default search action
Aaron Potechin
Person information
- affiliation: University of Chicago, USA
- affiliation (PhD 2015): MIT, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Aaron Potechin
, Aaron Zhang:
Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle. ICALP 2024: 117:1-117:20 - [c26]Pravesh K. Kothari
Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs. STOC 2024: 1923-1934 - [i35]Susanna F. de Rezende, Aaron Potechin, Kilian Risse:
Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients. CoRR abs/2404.16722 (2024) - [i34]Pravesh Kothari, Aaron Potechin, Jeff Xu:
Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs. CoRR abs/2406.18429 (2024) - [i33]Neng Huang, Will Perkins, Aaron Potechin:
Hardness of sampling for the anti-ferromagnetic Ising model on random graphs. CoRR abs/2409.03974 (2024) - 2023
- [c25]Aaron Potechin, Paxton M. Turner, Prayaag Venkat, Alexander S. Wein:
Near-optimal fitting of ellipsoids to random points. COLT 2023: 4235-4295 - [c24]Susanna F. de Rezende
Clique Is Hard on Average for Unary Sherali-Adams. FOCS 2023: 12-25 - [c23]Joshua Brakensiek, Neng Huang
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. FOCS 2023: 234-252 - [c22]Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin
Ellipsoid Fitting up to a Constant. ICALP 2023: 78:1-78:20 - [c21]Chris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu:
Sum-of-Squares Lower Bounds for Densest k-Subgraph. STOC 2023: 84-95 - [i32]Chris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu:
Sum-of-Squares Lower Bounds for Densest k-Subgraph. CoRR abs/2303.17506 (2023) - [i31]Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu:
Ellipsoid Fitting Up to a Constant. CoRR abs/2307.05954 (2023) - 2022
- [c20]Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin
Expander Random Walks: The General Case and Limitations. ICALP 2022: 43:1-43:18 - [c19]Chris Jones, Aaron Potechin
Almost-Orthogonal Bases for Inner Product Polynomials. ITCS 2022: 89:1-89:21 - [c18]Aaron Potechin, Goutham Rajendran:
Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis. NeurIPS 2022 - [i30]Aaron Potechin, Aaron Zhang
Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle and the Ordering Principle. CoRR abs/2205.03577 (2022) - [i29]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. CoRR abs/2212.11191 (2022) - 2021
- [c17]Chris Jones, Aaron Potechin
Sum-of-Squares Lower Bounds for Sparse Independent Set. FOCS 2021: 406-416 - [c16]Adam Kurpisz
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. ICALP 2021: 90:1-90:20 - [c15]Joshua Brakensiek, Neng Huang
On the Mysteries of MAX NAE-SAT. SODA 2021: 484-503 - [i28]Chris Jones, Aaron Potechin:
Almost-Orthogonal Bases for Inner Product Polynomials. CoRR abs/2107.00216 (2021) - [i27]Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth:
SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization. CoRR abs/2107.04100 (2021) - [i26]Chris Jones, Aaron Potechin, Goutham Rajendran, Madhur Tulsiani, Jeff Xu:
Sum-of-Squares Lower Bounds for Sparse Independent Set. CoRR abs/2111.09250 (2021) - [i25]Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma:
Expander Random Walks: The General Case and Limitations. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j6]Aaron Potechin
Lengths of words accepted by nondeterministic finite automata. Inf. Process. Lett. 162: 105993 (2020) - [c14]Neng Huang
On the Approximability of Presidential Type Predicates. APPROX-RANDOM 2020: 58:1-58:20 - [c13]Aaron Potechin
Sum of Squares Bounds for the Ordering Principle. CCC 2020: 38:1-38:37 - [c12]Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran:
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes. FOCS 2020: 954-965 - [i24]Wenjun Cai, Aaron Potechin:
The Spectrum of the Singular Values of Z-Shaped Graph Matrices. CoRR abs/2006.14144 (2020) - [i23]Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran:
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes. CoRR abs/2009.01874 (2020) - [i22]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
On the Mysteries of MAX NAE-SAT. CoRR abs/2009.10677 (2020) - [i21]Aaron Potechin, Goutham Rajendran:
Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems. CoRR abs/2011.04253 (2020) - [i20]Bohdan Kivva, Aaron Potechin:
Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS. CoRR abs/2011.09416 (2020)
2010 – 2019
- 2019
- [j5]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh K. Kothari, Ankur Moitra, Aaron Potechin
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. SIAM J. Comput. 48(2): 687-735 (2019) - [c11]Aaron Potechin
Sum of Squares Lower Bounds from Symmetry and a Good Story. ITCS 2019: 61:1-61:20 - [c10]Aaron Potechin
On the approximation resistance of balanced linear threshold functions. STOC 2019: 430-441 - [i19]Neng Huang, Aaron Potechin:
On the Approximability of Presidential Type Predicates. CoRR abs/1907.04451 (2019) - 2018
- [j4]Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. ACM Trans. Algorithms 14(3): 28:1-28:31 (2018) - [i18]Aaron Potechin, Jeffrey O. Shallit:
Lengths of Words Accepted by Nondeterministic Finite Automata. CoRR abs/1802.04708 (2018) - [i17]Aaron Potechin:
On the Approximation Resistance of Balanced Linear Threshold Functions. CoRR abs/1807.04421 (2018) - [i16]Aaron Potechin:
Sum of squares bounds for the total ordering principle. CoRR abs/1812.01163 (2018) - 2017
- [j3]Aaron Potechin
Bounds on Monotone Switching Networks for Directed Connectivity. J. ACM 64(4): 29:1-29:48 (2017) - [c9]Aaron Potechin
A Note on Amortized Branching Program Complexity. CCC 2017: 4:1-4:12 - [c8]Aaron Potechin, David Steurer
Exact tensor completion with sum-of-squares. COLT 2017: 1619-1673 - [c7]Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm
The Power of Sum-of-Squares for Detecting Hidden Structures. FOCS 2017: 720-731 - [i15]Aaron Potechin, David Steurer:
Exact tensor completion with sum-of-squares. CoRR abs/1702.06237 (2017) - [i14]Aaron Potechin, Liu Yang:
A Note on Property Testing Sum of Squares and Multivariate Polynomial Interpolation. CoRR abs/1709.03198 (2017) - [i13]Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer:
The power of sum-of-squares for detecting hidden structures. CoRR abs/1710.05017 (2017) - [i12]Aaron Potechin:
Sum of squares lower bounds from symmetry and a good story. CoRR abs/1711.11469 (2017) - 2016
- [c6]Dhruv Medarametla, Aaron Potechin
Bounds on the Norms of Uniform Low Degree Graph Matrices. APPROX-RANDOM 2016: 40:1-40:26 - [c5]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. FOCS 2016: 428-437 - [c4]Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm:
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. SODA 2016: 1079-1095 - [i11]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. CoRR abs/1604.03084 (2016) - [i10]Aaron Potechin:
A Note on Amortized Space Complexity. CoRR abs/1611.06632 (2016) - [i9]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c3]Raghu Meka, Aaron Potechin
Sum-of-squares Lower Bounds for Planted Clique. STOC 2015: 87-96 - [i8]Raghu Meka, Aaron Potechin, Avi Wigderson:
Sum-of-squares lower bounds for planted clique. CoRR abs/1503.06447 (2015) - [i7]Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin:
SoS and Planted Clique: Tight Analysis of MPW Moments at all Degrees and an Optimal Lower Bound at Degree Four. CoRR abs/1507.05230 (2015) - 2014
- [j2]Siu Man Chan, Aaron Potechin
Tight Bounds for Monotone Switching Networks via Fourier Analysis. Theory Comput. 10: 389-419 (2014) - 2013
- [i6]Joshua Brakensiek, Aaron Potechin:
Bounds on the Size of Sound Monotone Switching Networks Accepting Permutation Sets of Directed Trees. CoRR abs/1301.3780 (2013) - [i5]Aaron Potechin:
Improved upper and lower bound techniques for monotone switching networks for directed connectivity. CoRR abs/1302.3726 (2013) - 2012
- [c2]Siu Man Chan, Aaron Potechin:
Tight bounds for monotone switching networks via fourier analysis. STOC 2012: 495-504 - [i4]Siu Man Chan, Aaron Potechin:
Tight Bounds for Monotone Switching Networks via Fourier Analysis. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i3]Aaron Potechin:
Monotone switching networks for directed connectivity are strictly more powerful than certain-knowledge switching networks. CoRR abs/1111.2127 (2011) - 2010
- [c1]Aaron Potechin:
Bounds on Monotone Switching Networks for Directed Connectivity. FOCS 2010: 553-562
2000 – 2009
- 2009
- [i2]Aaron Potechin:
Bounds on monotone switching networks for directed connectivity. CoRR abs/0911.0664 (2009) - [i1]Aaron Potechin:
Bounds on Monotone Switching Networks for Directed Connectivity. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j1]Aaron Potechin
Maximal caps in AG (6, 3). Des. Codes Cryptogr. 46(3): 243-259 (2008)
Coauthor Index
aka: Pravesh K. Kothari
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-10-24 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: