Greg Kuperberg

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