Willem Klaas van Dam  Home/Search
Context Related
| illc.uva.nl/Public...S200204.text.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: illc.uva.nl/Publ...reportlist.php (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The content of the Chapters 3 through 7 of this Ph.D. thesis corresponds with the following articles written by the author. (Update)
Cited by: More
Logics of Propositional Control - Jelle Gerbrandy Dipartimento (Correct)
Towards a Logic of Rational Agency - van der Hoek, Wooldridge (2003) (Correct)
Cooperation, Knowledge, and Time: Alternating-time.. - van der Hoek, Wooldridge (2003) (Correct)
Similar documents (at the sentence level):
5.8%: Quantum Kolmogorov Complexity - Berthiaume, van Dam, Laplante (2000) (Correct)
Active bibliography (related documents): More All
0.7: Monotonicity of Quantum Relative Entropy Revisited - Petz (Correct)
0.7: Self-Testing of Universal and Fault-Tolerant Sets of.. - van Dam, Magniez.. (2000) (Correct)
0.6: On Quantum Coding for Ensembles of Mixed States - Howard Barnum Carlton (2001) (Correct)
Similar documents based on text: More All
2.0: Decision-Theoretic Robotic Surveillance - Massios (2002) (Correct)
1.9: Computations in Propositional Logic - Hendriks (1996) (Correct)
1.8: Computational Pitfalls in Tractable Grammatical Formalisms - Trautwein (1995) (Correct)
Related documents from co-citation: More All
8: Fun and Games: a Text on Game Theory (context) - Binmore - 1992
8: On modal logic interpretations for games - Harrenstein, van der Hoek et al. - 2002
8: Model Checking - Clarke, Grumberg et al. - 1994
BibTeX entry: (Update)
G.J.Veltink. Tools for PSF. ILLC Dissertation Series 1995-9. http://citeseer.ist.psu.edu/vandam02quantum.html More
@misc{ vandamphd,
author = "Wim van Dam",
title = "On Quantum Computation Theory",
text = "PhD thesis. ILLC Dissertation Series"
year = "2002",
url = "citeseer.ist.psu.edu/vandam02quantum.html" }
Citations (may not include all citations):660 An Introduction to Kolmogorov Complexity and its Application.. - Li, anyi - 1997
534 The complexity of theorem-proving procedures (context) - Cook - 1971
356 Computers and Intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
352 A Course in Computational Algebraic Number Theory (context) - Cohen - 1993
210 A fast quantum mechanical algorithm for database search - Grover - 1996
202 Wiley Series in Telecommunications (context) - Cover, Thomas et al. - 1991
168 Algorithms for quantum computation: Discrete logarithms and .. - Shor - 1997
167 Quantum Computation and Quantum Information (context) - Nielsen, Chuang - 2000
159 Three approaches to the quantitative definition of informati.. (context) - Kolmogorov - 1965
144 the power of quantum computation - Simon - 1997
127 with an application to the Entscheidungsproblem (context) - Turing, numbers - 1937
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
120 the length of programs for computing finite binary sequences - Chaitin - 1966
118 the Church-Turing principle and the universal quantum comput.. (context) - Deutsch - 1985
115 Robust characterizations of polynomials with applications to.. - Rubinfeld, Sudan - 1996
105 Bounded query classes (context) - Wagner - 1990
97 The mathematical theory of communication (context) - Shannon, Weaver - 1949
94 Self testingcorrecting with application to numerical problem - Michael, Ronitt et al. - 1990
90 Quantum cryptography: Public key distribution and coin tossi.. (context) - Bennett, Brassard - 1984
86 New directions in testing (context) - Lipton - 1991
81 Information and Computation (context) - Beigel, Gasarch et al. - 1993
81 Information and Computation (context) - Beigel, Kummer et al. - 1995
77 Horn and Charles R (context) - Roger - 1985
75 Some connections between bounded query classes and nonunifor.. - Amir, Beigel et al. - 1990
73 Tight bounds on quantum searching - Boyer, Brassard et al. - 1998
68 Bounded queries to SAT and the Boolean hierarchy - Beigel - 1991
64 A Classical Introduction to Modern Number Theory (context) - Ireland, Rosen - 1990
61 A taxonomy of complexity classes of functions - Selman - 1994
60 Query-limited Reducibilities - Beigel - 1987
56 The polynomial time hierarchy collapses if the Boolean hiera.. (context) - Kadin - 1988
52 Real algebraic and semi-algebraic sets (context) - Benedetti, Risler - 1990
50 Quantum algorithms revisited - Cleve, Ekert et al. - 1998
49 Quantum lower bounds by polynomials - Beals, Buhrman et al. - 1998
43 Self testingcorrecting polynomial and approximate function - Richard, Rubinfeld et al. - 1991
37 Quantum circuits with mixed states - Aharonov, Kitaev et al. - 1998
36 Complexity limitations on quantum computation - Fortnow, Rogers - 1998
36 Oracle quantum computing - Berthiaume, Brassard - 1994
35 On truth-table reducibility to SAT - Buss, Hay - 1991
34 Polynomial-time membership comparable sets - Ogihara - 1995
34 Communication via one- and twoparticle operators on Einstein.. (context) - Bennett, Wiesner - 1992
32 Quantum computations: Algorithms and error correction (context) - Kitaev - 1997
27 The Art of Computer Programming: Seminumerical Algorithms (context) - Knuth - 1998
25 Bounds for the quantity of information transmitted by a quan.. (context) - Holevo - 1973
25 the complexity of finding the chromatic number of a recursiv.. - Beigel, Gasarch - 1989
23 A relationship between difference hierarchies and relativize.. - Beigel, Chang et al. - 1993
23 of self-checking, self-testing and selfcorrecting programs (context) - Rubinfeld, theory - 1990
21 Orthogonal Arrays: Theory and Applications (context) - Hedayat, Sloane et al. - 1999
20 General properties of entropy (context) - Wehrl - 1978
17 Cryptographic distinguishability measures for quantum mechan.. (context) - Fuchs, Graaf - 1999
15 The quantum query complexity of approximating the median and.. - Nayak, Wu - 1999
13 Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity .. (context) - Uhlmann - 1977
12 the robustness of functional equations - Rubinfeld - 1994
11 Quantum computers can search arbitrarily large databases by .. (context) - Grover - 1997
11 Problemy Peredaci Informacii (context) - Levin, problems - 1973
11 and block designs (context) - Seberry, Yamada et al. - 1992
10 A preliminary report on a general theory of inductive infere.. (context) - Solomonoff - 1960
10 NP-hard sets are P-superterse unless R = NP (context) - Beigel - 1988
9 Optimal cloning of pure states - Werner - 1998
9 Quasi-linear truth-table reductions to pselective sets (context) - Agrawal, Arvind - 1996
8 Noncommuting mixed states cannot be broadcast (context) - Barnum, Caves et al. - 1996
8 Quantum complexity theory (context) - Bernstein, Vazirani - 1997
8 Characterizing classes of functions computable by quantum pa.. (context) - Jozsa - 1991
8 A downward translation in the polynomial hierarchy - Hemaspaandra, Hemaspaandra et al. - 1997
7 Invariant quantum algorithms for insertion into an ordered l.. (context) - Farhi, Goldstone et al. - 1999
7 Physical Review (context) - Schumacher - 1995
7 Single quantum querying of a database (context) - Terhal, Smolin - 1998
7 On universal and fault-tolerant quantum computing: A novel b.. - Boykin, Mor et al. - 1999
7 Quantum cryptography with imperfect apparatus (context) - Mayers, Yao - 1998
6 Quantum computing (context) - Preskill - 1998
6 Information and Computation (context) - Amir, Gasarch et al. - 1988
6 Limits for compression of quantum information carried by ens.. (context) - Horodecki - 1998
6 Quantum Information Theory - Nielsen - 1998
6 How many functions can be distinguished with k quantum queri.. (context) - Farhi, Goldstone et al. - 1999
6 Stabilisation of quantum computations by symmetrisation - Barenco, Berthiaume et al. - 1997
5 A limit on the speed of quantum computation in determining p.. (context) - Farhi, Goldstone et al. - 1998
5 A catalogue of complexity classes (context) - Johnson - 1990
5 Two queries - Buhrman, Fortnow - 1998
5 Completely positive maps and entropy inequalities (context) - Lindblad - 1975
5 Quantum algorithmic information theory - Svozil - 1996
5 On polynomial-time truth-table reducibility of intractable s.. (context) - Toda - 1991
4 Efficient quantum algorithms for shifted quadratic character.. (context) - van Dam, Hallgren - 2000
4 Sending quantum entanglement through noisy channels (context) - Schumacher - 1996
2 Information Processing Letters (context) - Shamir, in et al. - 1979
2 Quantum complexities of ordered searching (context) - Hyer, Neerbek et al. - 2076
2 Three approaches to the quantitative definition of informati.. (context) - anyi - 2000
2 Complex Hadamard matrices (context) - Turyn - 1996
2 improved bounds on the contraction of generalized relative e.. (context) - Ruskai, subadditivity - 1994
2 volume 72 of Fundamental Theories of Physics (context) - Peres, Concepts - 1995
1 and Ming-Deh (context) - Adleman, Demarrais - 1997
1 A family of Hadamard matrices of dihedral group type (context) - Shinoda, Yamada - 2000
1 en eralisation des polynomes d'Hermite (context) - Krawtchouk - 1929
1 and tessellated pavements in two or more colours (context) - Sylvester, inverse et al.
1 Bounded quantum query complexity (context) - Buhrman, van Dam - 1999
1 Also on the quant-ph archive (context) - Bennett, Bernstein et al. - 1997
1 volume 16 of North-Holland Mathematical Library (context) - MacWilliams, Sloane et al. - 1977
1 Hadamard matrices and dihedral groups (context) - Kimura - 1996
1 Quantum algorithmic entropy (context) - acs - 2001
1 Series on Discrete Mathematics and Applications (context) - Colbourn, Dinitz et al. - 1996
1 Two classical queries versus one quantum query (context) - van Dam - 1998
1 Journal of Mathematics and Physics (context) - Paley, matrices - 1933
1 Quantum kolmogorov complexity using classical descriptions (context) - anyi - 2001
1 esolution d'une question relative aux d eterminants (context) - Hadamard
http://www.cs.uow.edu.au/people/
http://www.research
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.illc.uva.nl/Publications/reportlist.php): More
When are Two Games the Same? - van Benthem (1999) (Correct)
Studies on the Uses and Usefulness of Diagrams - Berger (2000) (Correct)
Logical for Social Software - Pauly (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC