The quantum challenge to structural complexity theory
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 132-137
- https://doi.org/10.1109/sct.1992.215388
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Gap-definable counting classesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Quantum Bit Commitment and Coin Tossing ProtocolsPublished by Springer Nature ,2001
- Quantum cryptography without Bell’s theoremPhysical Review Letters, 1992
- Experimental quantum cryptographyJournal of Cryptology, 1992
- Characterizing classes of functions computable by quantum parallelismProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1991
- Limits on the provable consequences of one-way permutationsPublished by Association for Computing Machinery (ACM) ,1989
- Complexity Measures for Public-Key CryptosystemsSIAM Journal on Computing, 1988
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Reducibility, randomness, and intractibility (Abstract)Published by Association for Computing Machinery (ACM) ,1977