|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 18 occurrences of 10 keywords
|
|
|
|
|
Results
Found 23 publication records. Showing 23 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy |
Quantum Query Complexity of State Conversion.  |
FOCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang |
Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer.  |
SIAM J. Comput.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Quantum lower bounds, Boolean functions, Quantum computing, Quantum algorithms, Time-space tradeoffs |
| 1 | Robert Spalek |
A Dual Polynomial for OR  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Robert Spalek |
The Multiplicative Quantum Adversary.  |
IEEE Conference on Computational Complexity  |
2008 |
DBLP DOI BibTeX RDF |
quantum query lower bounds, quantum adversary method, multiplicative adversary, combinatorial matrices, direct product theorems |
| 1 | Troy Lee, Adi Shraibman, Robert Spalek |
A Direct Product Theorem for Discrepancy.  |
IEEE Conference on Computational Complexity  |
2008 |
DBLP DOI BibTeX RDF |
direct sum theorems, factorization norms, communication complexity, discrepancy, direct product theorems |
| 1 | Ben Reichardt, Robert Spalek |
Span-program-based quantum algorithm for evaluating formulas.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
balanced ternary majority formula, formula evaluation, gadget graphs, quantum adversary bound, quantum phase estimation, span programs, quantum computing, spectral analysis, quantum algorithms, quantum walks |
| 1 | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.  |
SIAM J. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang |
Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer.  |
FOCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Høyer, Troy Lee, Robert Spalek |
Negative weights make adversaries stronger.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
adversary method, certificate complexity barrier, formula size, quantum query complexity, lower bounds, quantum computing |
| 1 | Robert Spalek, Mario Szegedy |
All Quantum Adversary Methods are Equivalent.  |
Theory of Computing  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Robert Spalek |
Quantum verification of matrix products.  |
SODA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek |
Quantum Algorithms for Matching and Network Flows.  |
STACS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
lower bounds, quantum computing, time-space tradeoffs, direct product theorems |
| 1 | Peter Høyer, Robert Spalek |
Quantum Fan-out is Powerful.  |
Theory of Computing  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Peter Høyer, Robert Spalek |
Lower Bounds on Quantum Query Complexity.  |
Bulletin of the EATCS  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Robert Spalek, Mario Szegedy |
All Quantum Adversary Methods Are Equivalent.  |
ICALP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs  |
CoRR  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.  |
FOCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Høyer, Robert Spalek |
Quantum Circuits with Unbounded Fan-out.  |
STACS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Høyer, Robert Spalek |
Quantum Circuits with Unbounded Fan-out  |
CoRR  |
2002 |
DBLP BibTeX RDF |
|
Displaying result #1 - #23 of 23 (100 per page; Change: )
|
|