Quantum lower bounds by polynomials
- 27 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableAll Related Versions
This publication has 20 references indexed in Scilit:
- On oracle builder's toolkitPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the Monte Carlo Boolean decision tree complexity of read-once formulaePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Complexity limitations on quantum computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Quantum oracle interrogation: getting all information for almost half the pricePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1998
- On the Power of Quantum ComputationSIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Polynomials with two valuesCombinatorica, 1997
- A fast quantum mechanical algorithm for database searchPublished by Association for Computing Machinery (ACM) ,1996
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Schwankung von Polynomen zwischen GitterpunktenMathematische Zeitschrift, 1964