Noah Fleming

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the power and limitations of branch and cut Theory of Computing	2026-08-04	Paper
Random ( n)-CNFs are hard for cutting planes	2025-08-06	Paper
Limits of CDCL learning via merge resolution	2024-11-26	Paper
TFNP characterizations of proof systems and monotone circuits	2024-09-25	Paper
Low degree testing over the reals	2024-05-14	Paper
scientific article; zbMATH DE number 7829301 (Why is no real title available?)	2024-04-09	Paper
scientific article; zbMATH DE number 7829302 (Why is no real title available?)	2024-04-09	Paper
On the power and limitations of branch and cut (available as arXiv preprint)	2023-07-12	Paper
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes Journal of the ACM	2023-04-27	Paper
Distribution-Free Testing of Linear Functions on ℝⁿ (available as arXiv preprint)	2023-02-03	Paper
On the hierarchical community structure of practical Boolean formulas (available as arXiv preprint)	2022-03-22	Paper
Reflections on Proof Complexity and Counting Principles Outstanding Contributions to Logic	2022-02-04	Paper
Stabbing planes (available as arXiv preprint)	2021-06-15	Paper
Towards a complexity-theoretic understanding of restarts in SAT solvers (available as arXiv preprint)	2021-04-07	Paper
Semialgebraic Proofs and Efficient Algorithm Design Foundations and Trends® in Theoretical Computer Science	2020-02-13	Paper

Research outcomes over time

This page was built for person: Noah Fleming