Follow
Noah Fleming
Title
Cited by
Cited by
Year
Semialgebraic Proofs and Efficient Algorithm Design
N Fleming, P Kothari, T Pitassi
Foundations and Trends® in Theoretical Computer Science 14 (1-2), 1–221, 2019
802019
Random -CNFs are Hard for Cutting Planes
N Fleming, D Pankratov, T Pitassi, R Robere
ACM Journal of the ACM (JACM) 69 (3), 1-32, 2022
35*2022
Stabbing Planes
P Beame, N Fleming, R Impagliazzo, A Kolokolova, D Pankratov, T Pitassi, ...
9th Innovations in Theoretical Computer Science Conference (ITCS 2018) 94 …, 2018
312018
On the power and limitations of branch and cut
N Fleming, M Göös, R Impagliazzo, T Pitassi, R Robere, LY Tan, ...
arXiv preprint arXiv:2102.05019, 2021
142021
Towards a Complexity-theoretic Understanding of Restarts in SAT solvers
C Li, N Fleming, M Vinyals, T Pitassi, V Ganesh
Theory and Applications of Satisfiability Testing–SAT 2020: 23rd …, 2020
142020
On the hierarchical community structure of practical Boolean formulas
C Li, J Chung, S Mukherjee, M Vinyals, N Fleming, A Kolokolova, A Mu, ...
Theory and Applications of Satisfiability Testing–SAT 2021: 24th …, 2021
13*2021
On semi-algebraic proofs and algorithms
N Fleming, M Göös, S Grosser, R Robere
[Proceedings of ITCS 2022], 2022
72022
Distribution-Free Testing of Linear Functions on R^ n
N Fleming, Y Yoshida
arXiv preprint arXiv:1909.03391, 2019
72019
Predicting protein thermostability upon mutation using molecular dynamics timeseries data
N Fleming, B Kinsella, C Ing
bioRxiv, 078246, 2016
62016
Tfnp characterizations of proof systems and monotone circuits
S Buss, N Fleming, R Impagliazzo
14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023
42023
Low degree testing over the reals
V Arora, A Bhattacharyya, N Fleming, E Kelman, Y Yoshida
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
32023
Extremely deep proofs
N Fleming, T Pitassi, R Robere
13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022
32022
Reflections on proof complexity and counting principles
N Fleming, T Pitassi
Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of …, 2022
22022
Limits of CDCL Learning via Merge Resolution
M Vinyals, C Li, N Fleming, A Kolokolova, V Ganesh
arXiv preprint arXiv:2304.09422, 2023
12023
Black-box PPP is not Turing-closed
N Fleming, S Grosser, T Pitassi, R Robere
submission, 2023
12023
The Proof Complexity of Integer Programming
N Fleming
University of Toronto (Canada), 2021
12021
Cuckoo Hashing and Cuckoo Filters
N Fleming
12018
Complexity of alignment and decoding problems: restrictions and approximations
N Fleming, A Kolokolova, R Nizamee
Machine Translation 29, 163-187, 2015
2015
The system can't perform the operation now. Try again later.
Articles 1–18