Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Aaron Potechin
aka: Aaron Henry Potechin
University of Chicago, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 63 matches
- 2023
- Aaron Potechin, Paxton M. Turner, Prayaag Venkat, Alexander S. Wein:
Near-optimal fitting of ellipsoids to random points. COLT 2023: 4235-4295 - Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. FOCS 2023: 234-252 - Susanna F. de Rezende, Aaron Potechin, Kilian Risse:
Clique Is Hard on Average for Unary Sherali-Adams. FOCS 2023: 12-25 - Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu:
Ellipsoid Fitting up to a Constant. ICALP 2023: 78:1-78:20 - Chris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu:
Sum-of-Squares Lower Bounds for Densest k-Subgraph. STOC 2023: 84-95 - Chris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu:
Sum-of-Squares Lower Bounds for Densest k-Subgraph. CoRR abs/2303.17506 (2023) - Jun-Ting Hsieh, Pravesh K. Kothari, Aaron Potechin, Jeff Xu:
Ellipsoid Fitting Up to a Constant. CoRR abs/2307.05954 (2023) - 2022
- Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma:
Expander Random Walks: The General Case and Limitations. ICALP 2022: 43:1-43:18 - Chris Jones, Aaron Potechin:
Almost-Orthogonal Bases for Inner Product Polynomials. ITCS 2022: 89:1-89:21 - Aaron Potechin, Goutham Rajendran:
Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis. NeurIPS 2022 - 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) - Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. CoRR abs/2212.11191 (2022) - 2021
- Chris Jones, Aaron Potechin, Goutham Rajendran, Madhur Tulsiani, Jeff Xu:
Sum-of-Squares Lower Bounds for Sparse Independent Set. FOCS 2021: 406-416 - Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth:
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. ICALP 2021: 90:1-90:20 - Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
On the Mysteries of MAX NAE-SAT. SODA 2021: 484-503 - Chris Jones, Aaron Potechin:
Almost-Orthogonal Bases for Inner Product Polynomials. CoRR abs/2107.00216 (2021) - 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) - Chris Jones, Aaron Potechin, Goutham Rajendran, Madhur Tulsiani, Jeff Xu:
Sum-of-Squares Lower Bounds for Sparse Independent Set. CoRR abs/2111.09250 (2021) - 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
- Aaron Potechin, Jeffrey O. Shallit:
Lengths of words accepted by nondeterministic finite automata. Inf. Process. Lett. 162: 105993 (2020) - Neng Huang, Aaron Potechin:
On the Approximability of Presidential Type Predicates. APPROX-RANDOM 2020: 58:1-58:20 - Aaron Potechin:
Sum of Squares Bounds for the Ordering Principle. CCC 2020: 38:1-38:37 - 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 - Wenjun Cai, Aaron Potechin:
The Spectrum of the Singular Values of Z-Shaped Graph Matrices. CoRR abs/2006.14144 (2020) - 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) - Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
On the Mysteries of MAX NAE-SAT. CoRR abs/2009.10677 (2020) - Aaron Potechin, Goutham Rajendran:
Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems. CoRR abs/2011.04253 (2020) - Bohdan Kivva, Aaron Potechin:
Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS. CoRR abs/2011.09416 (2020) - 2019
- 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) - Aaron Potechin:
Sum of Squares Lower Bounds from Symmetry and a Good Story. ITCS 2019: 61:1-61:20
skipping 33 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-07 15:51 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint