Greg Kuperberg

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 6

Top Topics

Computational Complexity

Storage Requirements

Computational Cost

Quasi Invariant

Top Venues

Publications

Greg Kuperberg
Breaking the cubic barrier in the Solovay-Kitaev algorithm. CoRR (2023)
Greg Kuperberg, Eric Samperton
Coloring invariants of knots and links are often intractable. CoRR (2019)
Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban
The computational complexity of ball permutations. STOC (2017)
Greg Kuperberg, Eric Samperton
Computational complexity and 3-manifolds and zombies. CoRR (2017)
Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban
The Computational Complexity of Ball Permutations. CoRR (2016)
Greg Kuperberg
How Hard Is It to Approximate the Jones Polynomial? Theory Comput. 11 (2015)
Greg Kuperberg
Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. TQC (2013)
Greg Kuperberg, Shachar Lovett, Ron Peled
Probabilistic existence of regular combinatorial structures CoRR (2013)
Greg Kuperberg
Are Linearly Independent in Finite Dimensions. Am. Math. Mon. 119 (7) (2012)
Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang
On the Power of a Unique Quantum Witness. Theory Comput. 8 (1) (2012)
Greg Kuperberg, Shachar Lovett, Ron Peled
Probabilistic existence of rigid combinatorial structures. STOC (2012)
Greg Kuperberg, Shachar Lovett, Ron Peled
Probabilistic existence of rigid combinatorial structures CoRR (2011)
Greg Kuperberg
Knottedness is in NP, modulo GRH CoRR (2011)
Greg Kuperberg, Shachar Lovett, Ron Peled
Probabilistic existence of rigid combinatorial structures. Electron. Colloquium Comput. Complex. 18 (2011)
Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang
On the Power of a Unique Quantum Witness. ICS (2010)
Greg Kuperberg
How hard is it to approximate the Jones polynomial? CoRR (2009)
Scott Aaronson, Greg Kuperberg
Quantum versus Classical Proofs and Advice. Computational Complexity Conference (2007)
Scott Aaronson, Greg Kuperberg
Quantum Versus Classical Proofs and Advice. Theory Comput. 3 (1) (2007)
Greg Kuperberg
Numerical Cubature Using Error-Correcting Codes. SIAM J. Numer. Anal. 44 (3) (2006)
Greg Kuperberg
Numerical Cubature from Archimedes' Hat-box Theorem. SIAM J. Numer. Anal. 44 (3) (2006)
Scott Aaronson, Greg Kuperberg
Quantum Versus Classical Proofs and Advice. Electron. Colloquium Comput. Complex. 13 (055) (2006)
Scott Aaronson, Greg Kuperberg
Quantum Versus Classical Proofs and Advice CoRR (2006)
Greg Kuperberg
Special moments. Adv. Appl. Math. 34 (4) (2005)
Greg Kuperberg
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. SIAM J. Comput. 35 (1) (2005)
Greg Kuperberg
The capacity of hybrid quantum memory. IEEE Trans. Inf. Theory 49 (6) (2003)
Greg Kuperberg
Kasteleyn Cokernels. Electron. J. Comb. 9 (1) (2002)
Greg Kuperberg
An Exploration of the Permanent-Determinant Method. Electron. J. Comb. 5 (1998)
Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer
Asymptotically Optimal Covering Designs. J. Comb. Theory, Ser. A 75 (2) (1996)
Greg Kuperberg
Four Symmetry Classes of Plane Partitions under One Roof. J. Comb. Theory, Ser. A 75 (2) (1996)
Greg Kuperberg
Self-complementary Plane Partitions by Proctor's Minuscule Method. Eur. J. Comb. 15 (6) (1994)
Greg Kuperberg
Symmetries of Plane Partitions and the Permanent - Determinant Method. J. Comb. Theory, Ser. A 68 (1) (1994)
Greg Kuperberg, Wlodzimierz Kuperberg
Double-Lattice Packings of Convex Bodies in the Plane. Discret. Comput. Geom. 5 (1990)