Noah Fleming

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 34

Top Topics

Linear Functions

Dantzig Wolfe Decomposition

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere
Black-Box PPP is not Turing-Closed. Electron. Colloquium Comput. Complex. (2024)
Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere
Black-Box PPP Is Not Turing-Closed. STOC (2024)
Marc Vinyals, Chunxiao (Ian) Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh
Limits of CDCL Learning via Merge Resolution. CoRR (2023)
Noah Fleming, Vijay Ganesh, Antonina Kolokolova, Chunxiao Li, Marc Vinyals
Limits of CDCL Learning via Merge Resolution. Electron. Colloquium Comput. Complex. (2023)
Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida
Low Degree Testing over the Reals. SODA (2023)
Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh
Limits of CDCL Learning via Merge Resolution. SAT (2023)
Sam Buss, Noah Fleming, Russell Impagliazzo
TFNP Characterizations of Proof Systems and Monotone Circuits. ITCS (2023)
Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida
Low Degree Testing over the Reals. CoRR (2022)
Noah Fleming, Mika Göös, Stefan Grosser, Robert Robere
On Semi-Algebraic Proofs and Algorithms. ITCS (2022)
Noah Fleming, Toniann Pitassi, Robert Robere
Extremely Deep Proofs. ITCS (2022)
Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida
Low Degree Testing over the Reals. Electron. Colloquium Comput. Complex. (2022)
Noah Fleming, Stefan Grosser, Mika Göös, Robert Robere
On Semi-Algebraic Proofs and Algorithms. Electron. Colloquium Comput. Complex. 29 (2022)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. J. ACM 69 (3) (2022)
Sam Buss, Noah Fleming, Russell Impagliazzo
TFNP Characterizations of Proof Systems and Monotone Circuits. Electron. Colloquium Comput. Complex. (2022)
Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
On the Power and Limitations of Branch and Cut. CoRR (2021)
Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
On the Power and Limitations of Branch and Cut. Electron. Colloquium Comput. Complex. 28 (2021)
Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh
On the Hierarchical Community Structure of Practical Boolean Formulas. SAT (2021)
Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
On the Power and Limitations of Branch and Cut. Computational Complexity Conference (2021)
Noah Fleming, Toniann Pitassi
Reflections on Proof Complexity and Counting Principles. Electron. Colloquium Comput. Complex. 28 (2021)
Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh
On the Hierarchical Community Structure of Practical SAT Formulas. CoRR (2021)
Noah Fleming, Toniann Pitassi, Robert Robere
Extremely Deep Proofs. Electron. Colloquium Comput. Complex. 28 (2021)
Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh
Towards a Complexity-theoretic Understanding of Restarts in SAT solvers. CoRR (2020)
Noah Fleming, Yuichi Yoshida
Distribution-Free Testing of Linear Functions on ℝⁿ. ITCS (2020)
Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. SAT (2020)
Noah Fleming, Pravesh Kothari, Toniann Pitassi
Semialgebraic Proofs and Efficient Algorithm Design. Electron. Colloquium Comput. Complex. 26 (2019)
Noah Fleming, Yuichi Yoshida
Distribution-Free Testing of Linear Functions on R^n. CoRR (2019)
Noah Fleming, Pravesh Kothari, Toniann Pitassi
Semialgebraic Proofs and Efficient Algorithm Design. Found. Trends Theor. Comput. Sci. 14 (1-2) (2019)
Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
Stabbing Planes. ITCS (2018)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random Θ(log n)-CNFs Are Hard for Cutting Planes. FOCS (2017)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random CNFs are Hard for Cutting Planes. CoRR (2017)
Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
Stabbing Planes. Electron. Colloquium Comput. Complex. 24 (2017)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random CNFs are Hard for Cutting Planes. Electron. Colloquium Comput. Complex. 24 (2017)
Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
Stabbing Planes. CoRR (2017)
Noah Fleming, Antonina Kolokolova, Renesa Nizamee
Complexity of alignment and decoding problems: restrictions and approximations. Mach. Transl. 29 (3-4) (2015)