Aaron Potechin
Affiliations: University of Chicago, USA
 MIT, Cambridge, USA (PhD 2015)
According to our database^{1},
Aaron Potechin
authored at least 38 papers
between 2008 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on web.mit.edu
On csauthors.net:
Bibliography
2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
2022
Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle and the Ordering Principle.
CoRR, 2022
Subexponential time SumofSquares lower bounds for Principal Components Analysis.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
2021
Electron. Colloquium Comput. Complex., 2021
Proceedings of the 2021 ACMSIAM Symposium on Discrete Algorithms, 2021
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Inf. Process. Lett., 2020
Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree4 SOS.
CoRR, 2020
CoRR, 2020
CoRR, 2020
SumofSquares Lower Bounds for SherringtonKirkpatrick via Planted Affine Planes.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Proceedings of the 35th Computational Complexity Conference, 2020
Proceedings of the Approximation, 2020
2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019
2018
ACM Trans. Algorithms, 2018
CoRR, 2018
2017
J. ACM, 2017
A Note on Property Testing Sum of Squares and Multivariate Polynomial Interpolation.
CoRR, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
Proceedings of the 30th Conference on Learning Theory, 2017
Proceedings of the 32nd Computational Complexity Conference, 2017
2016
Electron. Colloquium Comput. Complex., 2016
CoRR, 2016
Proceedings of the Approximation, 2016
2015
SoS and Planted Clique: Tight Analysis of MPW Moments at all Degrees and an Optimal Lower Bound at Degree Four.
CoRR, 2015
Proceedings of the FortySeventh Annual ACM on Symposium on Theory of Computing, 2015
2014
Theory Comput., 2014
2013
Improved upper and lower bound techniques for monotone switching networks for directed connectivity
CoRR, 2013
Bounds on the Size of Sound Monotone Switching Networks Accepting Permutation Sets of Directed Trees
CoRR, 2013
2011
Monotone switching networks for directed connectivity are strictly more powerful than certainknowledge switching networks
CoRR, 2011
2008
Des. Codes Cryptogr., 2008