![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Greg Kuperberg
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i11]Greg Kuperberg:
Breaking the cubic barrier in the Solovay-Kitaev algorithm. CoRR abs/2306.13158 (2023)
2010 – 2019
- 2019
- [i10]Greg Kuperberg, Eric Samperton:
Coloring invariants of knots and links are often intractable. CoRR abs/1907.05981 (2019) - 2017
- [c5]Scott Aaronson, Adam Bouland
, Greg Kuperberg, Saeed Mehraban
:
The computational complexity of ball permutations. STOC 2017: 317-327 - [i9]Greg Kuperberg, Eric Samperton:
Computational complexity and 3-manifolds and zombies. CoRR abs/1707.03811 (2017) - 2016
- [i8]Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban:
The Computational Complexity of Ball Permutations. CoRR abs/1610.06646 (2016) - 2015
- [j16]Greg Kuperberg:
How Hard Is It to Approximate the Jones Polynomial? Theory Comput. 11: 183-219 (2015) - 2013
- [c4]Greg Kuperberg:
Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. TQC 2013: 20-34 - [i7]Greg Kuperberg, Shachar Lovett, Ron Peled:
Probabilistic existence of regular combinatorial structures. CoRR abs/1302.4295 (2013) - 2012
- [j15]Greg Kuperberg:
Norms as a Function of p Are Linearly Independent in Finite Dimensions. Am. Math. Mon. 119(7): 601-603 (2012) - [j14]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath
, Shengyu Zhang:
On the Power of a Unique Quantum Witness. Theory Comput. 8(1): 375-400 (2012) - [c3]Greg Kuperberg, Shachar Lovett
, Ron Peled
:
Probabilistic existence of rigid combinatorial structures. STOC 2012: 1091-1106 - 2011
- [i6]Greg Kuperberg, Shachar Lovett, Ron Peled:
Probabilistic existence of rigid combinatorial structures. CoRR abs/1111.0492 (2011) - [i5]Greg Kuperberg:
Knottedness is in NP, modulo GRH. CoRR abs/1112.0845 (2011) - [i4]Greg Kuperberg, Shachar Lovett, Ron Peled:
Probabilistic existence of rigid combinatorial structures. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c2]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. ICS 2010: 470-481
2000 – 2009
- 2009
- [i3]Greg Kuperberg:
How hard is it to approximate the Jones polynomial? CoRR abs/0908.0512 (2009) - 2007
- [j13]Scott Aaronson, Greg Kuperberg:
Quantum Versus Classical Proofs and Advice. Theory Comput. 3(1): 129-157 (2007) - [c1]Scott Aaronson, Greg Kuperberg:
Quantum versus Classical Proofs and Advice. CCC 2007: 115-128 - 2006
- [j12]Greg Kuperberg:
Numerical Cubature Using Error-Correcting Codes. SIAM J. Numer. Anal. 44(3): 897-907 (2006) - [j11]Greg Kuperberg:
Numerical Cubature from Archimedes' Hat-box Theorem. SIAM J. Numer. Anal. 44(3): 908-935 (2006) - [i2]Scott Aaronson, Greg Kuperberg:
Quantum Versus Classical Proofs and Advice. CoRR abs/quant-ph/0604056 (2006) - [i1]Scott Aaronson, Greg Kuperberg:
Quantum Versus Classical Proofs and Advice. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j10]Greg Kuperberg:
Special moments. Adv. Appl. Math. 34(4): 853-870 (2005) - [j9]Greg Kuperberg:
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. SIAM J. Comput. 35(1): 170-188 (2005) - 2003
- [j8]Greg Kuperberg:
The capacity of hybrid quantum memory. IEEE Trans. Inf. Theory 49(6): 1465-1473 (2003) - 2002
- [j7]Greg Kuperberg:
Kasteleyn Cokernels. Electron. J. Comb. 9(1) (2002)
1990 – 1999
- 1998
- [j6]Greg Kuperberg:
An Exploration of the Permanent-Determinant Method. Electron. J. Comb. 5 (1998) - 1996
- [j5]Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer:
Asymptotically Optimal Covering Designs. J. Comb. Theory A 75(2): 270-280 (1996) - [j4]Greg Kuperberg:
Four Symmetry Classes of Plane Partitions under One Roof. J. Comb. Theory A 75(2): 295-315 (1996) - 1994
- [j3]Greg Kuperberg:
Self-complementary Plane Partitions by Proctor's Minuscule Method. Eur. J. Comb. 15(6): 545-553 (1994) - [j2]Greg Kuperberg:
Symmetries of Plane Partitions and the Permanent - Determinant Method. J. Comb. Theory A 68(1): 115-151 (1994) - 1990
- [j1]Greg Kuperberg, Wlodzimierz Kuperberg:
Double-Lattice Packings of Convex Bodies in the Plane. Discret. Comput. Geom. 5: 389-397 (1990)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint