Follow
Aaron Potechin
Title
Cited by
Cited by
Year
A nearly tight sum-of-squares lower bound for the planted clique problem
B Barak, S Hopkins, J Kelner, PK Kothari, A Moitra, A Potechin
SIAM Journal on Computing 48 (2), 687-735, 2019
2642019
The power of sum-of-squares for detecting hidden structures
SB Hopkins, PK Kothari, A Potechin, P Raghavendra, T Schramm, ...
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
1492017
Sum-of-squares lower bounds for planted clique
R Meka, A Potechin, A Wigderson
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1252015
Exact tensor completion with sum-of-squares
A Potechin, D Steurer
Conference on Learning Theory, 1619-1673, 2017
772017
Sum-of-squares lower bounds for sherrington-kirkpatrick via planted affine planes
M Ghosh, FG Jeronimo, C Jones, A Potechin, G Rajendran
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
512020
Maximal caps in AG (6, 3)
A Potechin
Designs, Codes and Cryptography 46, 243-259, 2008
512008
On the integrality gap of degree-4 sum of squares for planted clique
SB Hopkins, P Kothari, AH Potechin, P Raghavendra, T Schramm
ACM Transactions on Algorithms (TALG) 14 (3), 1-31, 2018
482018
The critical group of a line graph
A Berget, A Manion, M Maxwell, A Potechin, V Reiner
Annals of Combinatorics 16, 449-488, 2012
352012
Tight bounds for monotone switching networks via Fourier analysis
SM Chan, A Potechin
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
292012
Sum-of-squares lower bounds for sparse independent set
C Jones, A Potechin, G Rajendran, M Tulsiani, J Xu
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
282022
Sos and planted clique: Tight analysis of MPW moments at all degrees and an optimal lower bound at degree four
SB Hopkins, PK Kothari, A Potechin
arXiv preprint arXiv:1507.05230, 2015
262015
Bounds on monotone switching networks for directed connectivity
A Potechin
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 553-562, 2010
262010
Graph matrices: Norm bounds and applications
K Ahn, D Medarametla, A Potechin
arXiv preprint arXiv:1604.03423, 2016
202016
Machinery for proving sum-of-squares lower bounds on certification problems
A Potechin, G Rajendran
arXiv preprint arXiv:2011.04253, 2020
152020
Lengths of words accepted by nondeterministic finite automata
A Potechin, J Shallit
Information Processing Letters 162, 105993, 2020
132020
Bounds on the norms of uniform low degree graph matrices
D Medarametla, A Potechin
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016
132016
Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis
A Potechin, G Rajendran
Advances in Neural Information Processing Systems 35, 35724-35740, 2022
112022
Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 sos
B Kivva, A Potechin
arXiv preprint arXiv:2011.09416, 2020
102020
Sum of squares bounds for the ordering principle
A Potechin
arXiv preprint arXiv:1812.01163, 2018
102018
Bounds on monotone switching networks for directed connectivity
A Potechin
Journal of the ACM (JACM) 64 (4), 1-48, 2017
102017
The system can't perform the operation now. Try again later.
Articles 1–20