Noah Fleming
ScholarGPS® ID: 73418350359424
Affiliation History
Discipline
Computer Science
Metrics Summary
Publication Count
7
Predicted Citations
48
Predicted h-index
3
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
Add
Delete
|
---|
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (journal article) Journal of the ACM, volume 69, issue 3, pages 1-32 (2022). |
Reflections on Proof Complexity and Counting Principles (book chapter) In Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs Springer International Publishing (2022) |
On the Hierarchical Community Structure of Practical Boolean Formulas (book chapter) In Theory and Applications of Satisfiability Testing – SAT 2021 Springer International Publishing (2021) |
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers (book chapter) In Theory and Applications of Satisfiability Testing – SAT 2020 Springer International Publishing (2020) |
Semialgebraic Proofs and Efficient Algorithm Design (journal article) Foundations and Trends® in Theoretical Computer Science, volume 14, issue 1-2, pages 1-221 (2018). |
Random Θ(log n)-CNFs Are Hard for Cutting Planes (conference) 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (2017) Berkeley, CA |
Predicting Protein Thermostability Upon Mutation Using Molecular Dynamics Timeseries Data (journal article) bioRxiv (2016). |