| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrew Drucker |
High-confidence predictions under adversarial uncertainty.  |
ITCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker |
Efficient Probabilistically Checkable Debates. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
Advice Coins for Classical and Quantum Computation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
Block sensitivity of minterm-transitive functions. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker, Ronald de Wolf |
Quantum Proofs for Classical Theorems. |
Theory of Computing, Graduate Surveys |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker, Ronald de Wolf |
Uniform approximation by (quantum) polynomials. |
Quantum Information & Computation |
2011 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
Advice Coins for Classical and Quantum Computation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
High-Confidence Predictions under Adversarial Uncertainty |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
A PCP Characterization of AM. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
Advice Coins for Classical and Quantum Computation. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker |
Efficient Probabilistically Checkable Debates. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker |
Improved Direct Product Theorems for Randomized Query Complexity. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker |
Improved Direct Product Theorems for Randomized Query Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
A PCP Characterization of AM. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
A Full Characterization of Quantum Advice. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
A Full Characterization of Quantum Advice |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
Improved Direct Product Theorems for Randomized Query Complexity |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
Block Sensitivity of Minterm-Transitive Functions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
A PCP Characterization of AM |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Andrew Drucker |
A full characterization of quantum advice. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker, Ronald de Wolf |
Quantum Proofs for Classical Theorems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor |
The Power of Unentanglement. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker, Ronald de Wolf |
Quantum Proofs for Classical Theorems |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
Multitask Efficiencies in the Decision Tree Model. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker |
Multitask Efficiencies in the Decision Tree Model. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor |
The Power of Unentanglement. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker |
Multitask Efficiencies in the Decision Tree Model |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor |
The Power of Unentanglement. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
QMA, 3SAT, PCP Theorem, quantum computing, additivity, entanglement |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")