 | 2012 |
| 21 |  | Greg Kuperberg,
Shachar Lovett,
Ron Peled:
Probabilistic existence of rigid combinatorial structures.
STOC 2012: 1091-1106 |
| 2011 |
| 20 |  | Greg Kuperberg,
Shachar Lovett,
Ron Peled:
Probabilistic existence of rigid combinatorial structures
CoRR abs/1111.0492: (2011) |
| 19 |  | Greg Kuperberg:
Knottedness is in NP, modulo GRH
CoRR abs/1112.0845: (2011) |
| 18 |  | Greg Kuperberg,
Shachar Lovett,
Ron Peled:
Probabilistic existence of rigid combinatorial structures.
Electronic Colloquium on Computational Complexity (ECCC) 18: 144 (2011) |
| 2010 |
| 17 |  | Rahul Jain,
Iordanis Kerenidis,
Greg Kuperberg,
Miklos Santha,
Or Sattath,
Shengyu Zhang:
On the Power of a Unique Quantum Witness.
ICS 2010: 470-481 |
| 2009 |
| 16 |  | Greg Kuperberg:
How hard is it to approximate the Jones polynomial?
CoRR abs/0908.0512: (2009) |
| 2007 |
| 15 |  | Scott Aaronson,
Greg Kuperberg:
Quantum versus Classical Proofs and Advice.
IEEE Conference on Computational Complexity 2007: 115-128 |
| 14 |  | Scott Aaronson,
Greg Kuperberg:
Quantum Versus Classical Proofs and Advice.
Theory of Computing 3(1): 129-157 (2007) |
| 2006 |
| 13 |  | Scott Aaronson,
Greg Kuperberg:
Quantum Versus Classical Proofs and Advice
CoRR abs/quant-ph/0604056: (2006) |
| 12 |  | Scott Aaronson,
Greg Kuperberg:
Quantum Versus Classical Proofs and Advice.
Electronic Colloquium on Computational Complexity (ECCC) 13(055): (2006) |
| 11 |  | Greg Kuperberg:
Numerical Cubature Using Error-Correcting Codes.
SIAM J. Numerical Analysis 44(3): 897-907 (2006) |
| 10 |  | Greg Kuperberg:
Numerical Cubature from Archimedes' Hat-box Theorem.
SIAM J. Numerical Analysis 44(3): 908-935 (2006) |
| 2005 |
| 9 |  | Greg Kuperberg:
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem.
SIAM J. Comput. 35(1): 170-188 (2005) |
| 2003 |
| 8 |  | Greg Kuperberg:
The capacity of hybrid quantum memory.
IEEE Transactions on Information Theory 49(6): 1465-1473 (2003) |
| 2002 |
| 7 |  | Greg Kuperberg:
Kasteleyn Cokernels.
Electr. J. Comb. 9(1): (2002) |
| 1998 |
| 6 |  | Greg Kuperberg:
An Exploration of the Permanent-Determinant Method.
Electr. J. Comb. 5: (1998) |
| 1996 |
| 5 |  | Daniel M. Gordon,
Oren Patashnik,
Greg Kuperberg,
Joel Spencer:
Asymptotically Optimal Covering Designs.
J. Comb. Theory, Ser. A 75(2): 270-280 (1996) |
| 4 |  | Greg Kuperberg:
Four Symmetry Classes of Plane Partitions under One Roof.
J. Comb. Theory, Ser. A 75(2): 295-315 (1996) |
| 1994 |
| 3 |  | Greg Kuperberg:
Self-complementary Plane Partitions by Proctor's Minuscule Method.
Eur. J. Comb. 15(6): 545-553 (1994) |
| 2 |  | Greg Kuperberg:
Symmetries of Plane Partitions and the Permanent - Determinant Method.
J. Comb. Theory, Ser. A 68(1): 115-151 (1994) |
| 1990 |
| 1 |  | Greg Kuperberg,
Wlodzimierz Kuperberg:
Double-Lattice Packings of Convex Bodies in the Plane.
Discrete & Computational Geometry 5: 389-397 (1990) |