default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoah Fleming
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Noah Fleming
, Stefan Grosser, Toniann Pitassi, Robert Robere:
Black-Box PPP Is Not Turing-Closed. STOC 2024: 1405-1414- [i23]Noah Fleming, Yuichi Yoshida:
Sensitivity Lower Bounds for Approximaiton Algorithms. CoRR abs/2411.02744 (2024) - [i22]Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang:
Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. CoRR abs/2411.14267 (2024) - [i21]Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere:
Black-Box PPP is not Turing-Closed. Electron. Colloquium Comput. Complex. TR24 (2024) - [i20]Noah Fleming, Yuichi Yoshida:
Sensitivity Lower Bounds for Approximaiton Algorithms. Electron. Colloquium Comput. Complex. TR24 (2024) - [i19]Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang:
Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c11]Sam Buss, Noah Fleming, Russell Impagliazzo:
TFNP Characterizations of Proof Systems and Monotone Circuits. ITCS 2023: 30:1-30:40 - [c10]Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh:
Limits of CDCL Learning via Merge Resolution. SAT 2023: 27:1-27:19 - [c9]Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida:
Low Degree Testing over the Reals. SODA 2023: 738-792 - [i18]Marc Vinyals, Chunxiao (Ian) Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh:
Limits of CDCL Learning via Merge Resolution. CoRR abs/2304.09422 (2023) - [i17]Noah Fleming, Vijay Ganesh, Antonina Kolokolova, Chunxiao Li, Marc Vinyals:
Limits of CDCL Learning via Merge Resolution. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j3]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. J. ACM 69(3): 19:1-19:32 (2022) - [c8]Noah Fleming, Mika Göös, Stefan Grosser, Robert Robere:
On Semi-Algebraic Proofs and Algorithms. ITCS 2022: 69:1-69:25 - [c7]Noah Fleming, Toniann Pitassi, Robert Robere:
Extremely Deep Proofs. ITCS 2022: 70:1-70:23 - [i16]Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida:
Low Degree Testing over the Reals. CoRR abs/2204.08404 (2022) - [i15]Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida:
Low Degree Testing over the Reals. Electron. Colloquium Comput. Complex. TR22 (2022) - [i14]Sam Buss, Noah Fleming, Russell Impagliazzo:
TFNP Characterizations of Proof Systems and Monotone Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - [i13]Noah Fleming, Stefan Grosser, Mika Göös, Robert Robere:
On Semi-Algebraic Proofs and Algorithms. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [b1]Noah Fleming:
The Proof Complexity of Integer Programming. University of Toronto, Canada, 2021 - [c6]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. CCC 2021: 6:1-6:30 - [c5]Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh:
On the Hierarchical Community Structure of Practical Boolean Formulas. SAT 2021: 359-376 - [i12]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. CoRR abs/2102.05019 (2021) - [i11]Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh:
On the Hierarchical Community Structure of Practical SAT Formulas. CoRR abs/2103.14992 (2021) - [i10]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. Electron. Colloquium Comput. Complex. TR21 (2021) - [i9]Noah Fleming, Toniann Pitassi:
Reflections on Proof Complexity and Counting Principles. Electron. Colloquium Comput. Complex. TR21 (2021) - [i8]Noah Fleming, Toniann Pitassi, Robert Robere:
Extremely Deep Proofs. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c4]Noah Fleming, Yuichi Yoshida:
Distribution-Free Testing of Linear Functions on ℝⁿ. ITCS 2020: 22:1-22:19 - [c3]Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh:
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers. SAT 2020: 233-249 - [i7]Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh:
Towards a Complexity-theoretic Understanding of Restarts in SAT solvers. CoRR abs/2003.02323 (2020)
2010 – 2019
- 2019
- [j2]Noah Fleming, Pravesh Kothari, Toniann Pitassi:
Semialgebraic Proofs and Efficient Algorithm Design. Found. Trends Theor. Comput. Sci. 14(1-2): 1-221 (2019) - [i6]Noah Fleming, Yuichi Yoshida:
Distribution-Free Testing of Linear Functions on R^n. CoRR abs/1909.03391 (2019) - [i5]Noah Fleming, Pravesh Kothari, Toniann Pitassi:
Semialgebraic Proofs and Efficient Algorithm Design. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c2]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. ITCS 2018: 10:1-10:20 - 2017
- [c1]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random Θ(log n)-CNFs Are Hard for Cutting Planes. FOCS 2017: 109-120 - [i4]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random CNFs are Hard for Cutting Planes. CoRR abs/1703.02469 (2017) - [i3]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. CoRR abs/1710.03219 (2017) - [i2]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. Electron. Colloquium Comput. Complex. TR17 (2017) - [i1]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random CNFs are Hard for Cutting Planes. Electron. Colloquium Comput. Complex. TR17 (2017) - 2015
- [j1]Noah Fleming, Antonina Kolokolova, Renesa Nizamee:
Complexity of alignment and decoding problems: restrictions and approximations. Mach. Transl. 29(3-4): 163-187 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
