Complexity of alignment and decoding problems: restrictions and approximations. - Noah Fleming; Antonina Kolokolova; Renesa Nizamee (Mach. Transl., 2015)

Random Θ(log n)-CNFs Are Hard for Cutting Planes. - Noah Fleming; Denis Pankratov; Toniann Pitassi; Robert Robere (FOCS, 2017)

Stabbing Planes. - Paul Beame; Noah Fleming; Russell Impagliazzo; Antonina Kolokolova; Denis Pankratov; Toniann Pitassi; Robert Robere (Electron. Colloquium Comput. Complex., 2017)

Random CNFs are Hard for Cutting Planes. - Noah Fleming; Denis Pankratov; Toniann Pitassi; Robert Robere (Electron. Colloquium Comput. Complex., 2017)

Distribution-Free Testing of Linear Functions on R^n. - Noah Fleming; Yuichi Yoshida (CoRR, 2019)

Semialgebraic Proofs and Efficient Algorithm Design. - Noah Fleming; Pravesh Kothari; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2019)

Distribution-Free Testing of Linear Functions on ℝⁿ. - Noah Fleming; Yuichi Yoshida (ITCS, 2020)

Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. - Chunxiao Li 002; Noah Fleming; Marc Vinyals; Toniann Pitassi; Vijay Ganesh 001 (SAT, 2020)

On the Hierarchical Community Structure of Practical Boolean Formulas. - Chunxiao Li 002; Jonathan Chung 003; Soham Mukherjee; Marc Vinyals; Noah Fleming; Antonina Kolokolova; Alice Mu; Vijay Ganesh 001 (SAT, 2021)

On the Hierarchical Community Structure of Practical SAT Formulas. - Chunxiao Li 002; Jonathan Chung 003; Soham Mukherjee; Marc Vinyals; Noah Fleming; Antonina Kolokolova; Alice Mu; Vijay Ganesh 001 (CoRR, 2021)

On the Power and Limitations of Branch and Cut. - Noah Fleming; Mika Göös; Russell Impagliazzo; Toniann Pitassi; Robert Robere; Li-Yang Tan; Avi Wigderson (Electron. Colloquium Comput. Complex., 2021)

Reflections on Proof Complexity and Counting Principles. - Noah Fleming; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2021)

Extremely Deep Proofs. - Noah Fleming; Toniann Pitassi; Robert Robere (Electron. Colloquium Comput. Complex., 2021)

The Proof Complexity of Integer Programming. - Noah Fleming (2021)

Low Degree Testing over the Reals. - Vipul Arora 002; Arnab Bhattacharyya 001; Noah Fleming; Esty Kelman; Yuichi Yoshida (Electron. Colloquium Comput. Complex., 2022)

TFNP Characterizations of Proof Systems and Monotone Circuits. - Sam Buss; Noah Fleming; Russell Impagliazzo (Electron. Colloquium Comput. Complex., 2022)

On Semi-Algebraic Proofs and Algorithms. - Noah Fleming; Stefan Grosser; Mika Göös; Robert Robere (Electron. Colloquium Comput. Complex., 2022)

Random ( Theta ( log n) ) -CNFs are Hard for Cutting Planes. - Noah Fleming; Denis Pankratov; Toniann Pitassi; Robert Robere (J. ACM, 2022)

Limits of CDCL Learning via Merge Resolution. - Noah Fleming; Vijay Ganesh 001; Antonina Kolokolova; Chunxiao Li 002; Marc Vinyals (Electron. Colloquium Comput. Complex., 2023)

Black-Box PPP is not Turing-Closed. - Noah Fleming; Stefan Grosser; Toniann Pitassi; Robert Robere (Electron. Colloquium Comput. Complex., 2024)

Sensitivity Lower Bounds for Approximaiton Algorithms. - Noah Fleming; Yuichi Yoshida (Electron. Colloquium Comput. Complex., 2024)

Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. - Susanna F. de Rezende; Noah Fleming; Duri Andrea Janett; Jakob Nordström; Shuo Pang 002 (Electron. Colloquium Comput. Complex., 2024)

Provably Total Functions in the Polynomial Hierarchy. - Noah Fleming; Christophe Marciot; Deniz Imrek (Electron. Colloquium Comput. Complex., 2025)