Noah Fleming

From MaRDI portal
Person:2118319

Available identifiers

zbMath Open fleming.noahMaRDI QIDQ2118319

List of research outcomes





PublicationDate of PublicationType
Limits of CDCL learning via merge resolution2024-11-26Paper
TFNP characterizations of proof systems and monotone circuits2024-09-25Paper
Low degree testing over the reals2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61263072024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61263082024-04-09Paper
On the power and limitations of branch and cut2023-07-12Paper
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes2023-04-27Paper
Distribution-Free Testing of Linear Functions on ℝⁿ2023-02-03Paper
On the hierarchical community structure of practical Boolean formulas2022-03-22Paper
Reflections on Proof Complexity and Counting Principles2022-02-04Paper
https://portal.mardi4nfdi.de/entity/Q49932732021-06-15Paper
Towards a complexity-theoretic understanding of restarts in SAT solvers2021-04-07Paper
Semialgebraic Proofs and Efficient Algorithm Design2020-02-13Paper

Research outcomes over time

This page was built for person: Noah Fleming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2118319&oldid=7697148"
Powered by MediaWiki