 | 2012 |
|---|
| 29 |       | Andrew Drucker:
High-confidence predictions under adversarial uncertainty.
ITCS 2012: 1-10 |
| 2011 |
|---|
| 28 | | Andrew Drucker:
Efficient Probabilistically Checkable Debates.
APPROX-RANDOM 2011: 519-529 |
| 27 | | Andrew Drucker:
A PCP Characterization of AM.
ICALP (1) 2011: 581-592 |
| 26 | | Scott Aaronson,
Andrew Drucker:
Advice Coins for Classical and Quantum Computation.
ICALP (1) 2011: 61-72 |
| 25 | | Andrew Drucker:
Improved Direct Product Theorems for Randomized Query Complexity.
IEEE Conference on Computational Complexity 2011: 1-11 |
| 24 | | Andrew Drucker:
High-Confidence Predictions under Adversarial Uncertainty
CoRR abs/1101.4446: (2011) |
| 23 | | Scott Aaronson,
Andrew Drucker:
Advice Coins for Classical and Quantum Computation
CoRR abs/1101.5355: (2011) |
| 22 | | Andrew Drucker:
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators.
Electronic Colloquium on Computational Complexity (ECCC) 18: 125 (2011) |
| 21 | | Andrew Drucker:
Efficient Probabilistically Checkable Debates.
Electronic Colloquium on Computational Complexity (ECCC) 18: 73 (2011) |
| 20 | | Scott Aaronson,
Andrew Drucker:
Advice Coins for Classical and Quantum Computation.
Electronic Colloquium on Computational Complexity (ECCC) 18: 8 (2011) |
| 19 | | Andrew Drucker,
Ronald de Wolf:
Uniform approximation by (quantum) polynomials.
Quantum Information & Computation 11(3&4): 215-225 (2011) |
| 18 | | Andrew Drucker:
Block sensitivity of minterm-transitive functions.
Theor. Comput. Sci. 412(41): 5796-5801 (2011) |
| 17 | | Andrew Drucker,
Ronald de Wolf:
Quantum Proofs for Classical Theorems.
Theory of Computing, Graduate Surveys 2: 1-54 (2011) |
| 2010 |
|---|
| 16 | | Scott Aaronson,
Andrew Drucker:
A full characterization of quantum advice.
STOC 2010: 131-140 |
| 15 | | Andrew Drucker:
Block Sensitivity of Minterm-Transitive Functions
CoRR abs/1001.2052: (2010) |
| 14 | | Andrew Drucker:
A PCP Characterization of AM
CoRR abs/1002.3664: (2010) |
| 13 | | Scott Aaronson,
Andrew Drucker:
A Full Characterization of Quantum Advice
CoRR abs/1004.0377: (2010) |
| 12 | | Andrew Drucker:
Improved Direct Product Theorems for Randomized Query Complexity
CoRR abs/1005.0644: (2010) |
| 11 | | Andrew Drucker:
A PCP Characterization of AM.
Electronic Colloquium on Computational Complexity (ECCC) 17: 19 (2010) |
| 10 | | Scott Aaronson,
Andrew Drucker:
A Full Characterization of Quantum Advice.
Electronic Colloquium on Computational Complexity (ECCC) 17: 57 (2010) |
| 9 | | Andrew Drucker:
Improved Direct Product Theorems for Randomized Query Complexity.
Electronic Colloquium on Computational Complexity (ECCC) 17: 80 (2010) |
| 2009 |
|---|
| 8 | | Andrew Drucker:
Multitask Efficiencies in the Decision Tree Model.
IEEE Conference on Computational Complexity 2009: 286-297 |
| 7 | | Andrew Drucker,
Ronald de Wolf:
Quantum Proofs for Classical Theorems
CoRR abs/0910.3376: (2009) |
| 6 | | Andrew Drucker,
Ronald de Wolf:
Quantum Proofs for Classical Theorems.
Electronic Colloquium on Computational Complexity (ECCC) 16: 102 (2009) |
| 5 | | Scott Aaronson,
Salman Beigi,
Andrew Drucker,
Bill Fefferman,
Peter W. Shor:
The Power of Unentanglement.
Theory of Computing 5(1): 1-42 (2009) |
| 2008 |
|---|
| 4 | | Scott Aaronson,
Salman Beigi,
Andrew Drucker,
Bill Fefferman,
Peter W. Shor:
The Power of Unentanglement.
IEEE Conference on Computational Complexity 2008: 223-236 |
| 3 | | Andrew Drucker:
Multitask Efficiencies in the Decision Tree Model
CoRR abs/0808.2662: (2008) |
| 2 | | Scott Aaronson,
Salman Beigi,
Andrew Drucker,
Bill Fefferman,
Peter W. Shor:
The Power of Unentanglement.
Electronic Colloquium on Computational Complexity (ECCC) 15(051): (2008) |
| 1 | | Andrew Drucker:
Multitask Efficiencies in the Decision Tree Model.
Electronic Colloquium on Computational Complexity (ECCC) 15(096): (2008) |
Data released under the ODC-BY 1.0 license — See also our legal information page