default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing, Volume 1
Volume 1, Number 1, 2005
- Scott Aaronson:
Limitations of Quantum Advice and One-Way Communication. 1-28 - Samuel Kutin:
Quantum Lower Bound for the Collision Problem with Small Range. 29-36 - Andris Ambainis:
Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range. 37-46 - Scott Aaronson, Andris Ambainis:
Quantum Search of Spatial Regions. 47-79 - Peter Høyer
, Robert Spalek:
Quantum Fan-out is Powerful. 81-103 - Yossi Azar, Avrim Blum, David P. Bunde, Yishay Mansour:
Combining Online Algorithms for Acceptance and Rejection. 105-117 - Johan Håstad, Subhash Khot:
Query Efficient PCPs with Perfect Completeness. 119-148 - Miklós Ajtai:
A Non-linear Time Lower Bound for Boolean Branching Programs. 149-176 - Noga Alon, Asaf Shapira:
Linear Equations, Arithmetic Progressions and Hypergraph Property Testing. 177-216
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-19 01:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
