default search action
Robert Robere
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Susanna F. de Rezende
, Or Meir, Jakob Nordström
KRW Composition Theorems via Lifting. Comput. Complex. 33(1): 4 (2024) - [j5]Mika Göös
Separations in Proof Complexity and TFNP. J. ACM 71(4): 26:1-26:45 (2024) - [j4]Mika Göös, Alexandros Hollender
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\). SIAM J. Comput. 53(3): 573-587 (2024) - [c30]Siddhartha Jain, Jiawei Li, Robert Robere, Zhiyang Xun:
On Pigeonhole Principles and Ramsey in TFNP. FOCS 2024: 406-428 - [c29]Yuhao Li, William Pires, Robert Robere:
Intersection Classes in TFNP and Proof Complexity. ITCS 2024: 74:1-74:22 - [c28]Noah Fleming
Black-Box PPP Is Not Turing-Closed. STOC 2024: 1405-1414 - [i34]Siddhartha Jain, Jiawei Li, Robert Robere, Zhiyang Xun:
On Pigeonhole Principles and Ramsey in TFNP. CoRR abs/2401.12604 (2024) - [i33]Siddhartha Jain, Jiawei Li, Robert Robere, Zhiyang Xun:
On Pigeonhole Principles and Ramsey in TFNP. Electron. Colloquium Comput. Complex. TR24 (2024) - [i32]Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere:
Black-Box PPP is not Turing-Closed. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c27]Ben Davis, Robert Robere:
Colourful TFNP and Propositional Proofs. CCC 2023: 36:1-36:21 - [c26]Elette Boyle, Yuval Ishai, Pierre Meyer, Robert Robere, Gal Yehuda:
On Low-End Obfuscation and Learning. ITCS 2023: 23:1-23:28 - [i31]Ben Davis, Robert Robere:
Colourful TFNP and Propositional Proofs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j3]Noah Fleming
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. J. ACM 69(3): 19:1-19:32 (2022) - [j2]Susanna F. de Rezende, Mika Göös, Robert Robere:
Guest Column: Proofs, Circuits, and Communication. SIGACT News 53(1): 59-82 (2022) - [c25]Mika Göös, Alexandros Hollender, Siddhartha Jain
Further Collapses in TFNP. CCC 2022: 33:1-33:15 - [c24]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. FOCS 2022: 1150-1161 - [c23]Reyad Abed Elrazik, Robert Robere, Assaf Schuster, Gal Yehuda:
Pseudorandom Self-Reductions for NP-Complete Problems. ITCS 2022: 65:1-65:12 - [c22]Noah Fleming, Mika Göös, Stefan Grosser, Robert Robere:
On Semi-Algebraic Proofs and Algorithms. ITCS 2022: 69:1-69:25 - [c21]Noah Fleming, Toniann Pitassi, Robert Robere:
Extremely Deep Proofs. ITCS 2022: 70:1-70:23 - [i30]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. CoRR abs/2202.07761 (2022) - [i29]Susanna F. de Rezende, Mika Göös, Robert Robere:
Proofs, Circuits, and Communication. CoRR abs/2202.08909 (2022) - [i28]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. CoRR abs/2205.02168 (2022) - [i27]Noah Fleming, Stefan Grosser, Mika Göös, Robert Robere:
On Semi-Algebraic Proofs and Algorithms. Electron. Colloquium Comput. Complex. TR22 (2022) - [i26]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Further Collapses in TFNP. Electron. Colloquium Comput. Complex. TR22 (2022) - [i25]Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao:
Separations in Proof Complexity and TFNP. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j1]Susanna F. de Rezende
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Comput. Complex. 30(1): 4 (2021) - [c20]Noah Fleming, Mika Göös, Russell Impagliazzo
On the Power and Limitations of Branch and Cut. CCC 2021: 6:1-6:30 - [c19]Robert Robere, Jeroen Zuiddam:
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. FOCS 2021: 759-769 - [c18]Susanna F. de Rezende
Automating algebraic proof systems is NP-hard. STOC 2021: 209-222 - [i24]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) - [i23]Reyad Abed Elrazik, Robert Robere, Assaf Schuster, Gal Yehuda:
Pseudorandom Self-Reductions for NP-Complete Problems. Electron. Colloquium Comput. Complex. TR21 (2021) - [i22]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) - [i21]Noah Fleming, Toniann Pitassi, Robert Robere:
Extremely Deep Proofs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i20]Robert Robere, Jeroen Zuiddam:
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c17]Susanna F. de Rezende
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS 2020: 24-30 - [c16]Susanna F. de Rezende
KRW Composition Theorems via Lifting. FOCS 2020: 43-49 - [c15]Anna Gál, Robert Robere:
Lower Bounds for (Non-Monotone) Comparator Circuits. ITCS 2020: 58:1-58:13 - [i19]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals:
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. CoRR abs/2001.02144 (2020) - [i18]Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CoRR abs/2001.02481 (2020) - [i17]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. CoRR abs/2007.02740 (2020) - [i16]Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende:
Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. TR20 (2020) - [i15]Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Electron. Colloquium Comput. Complex. TR20 (2020) - [i14]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c14]Susanna F. de Rezende
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CCC 2019: 18:1-18:16 - [c13]Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov
Adventures in Monotone Complexity and TFNP. ITCS 2019: 38:1-38:19 - [i13]Anna Gál, Robert Robere:
Lower Bounds for (Non-monotone) Comparator Circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - [i12]Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende:
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [b1]Robert Robere:
Unified Lower Bounds for Monotone Computation. University of Toronto, Canada, 2018 - [c12]Robert Robere, Antonina Kolokolova, Vijay Ganesh
The Proof Complexity of SMT Solvers. CAV (2) 2018: 275-293 - [c11]Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger
Learning-Sensitive Backdoors with Restarts. CP 2018: 453-469 - [c10]Paul Beame
Stabbing Planes. ITCS 2018: 10:1-10:20 - [c9]Toniann Pitassi, Robert Robere:
Lifting nullstellensatz to monotone span programs over any field. STOC 2018: 1207-1219 - [i11]Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov:
Adventures in Monotone Complexity and TFNP. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c8]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random Θ(log n)-CNFs Are Hard for Cutting Planes. FOCS 2017: 109-120 - [c7]Toniann Pitassi, Robert Robere:
Strongly exponential lower bounds for monotone computation. STOC 2017: 1246-1255 - [i10]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random CNFs are Hard for Cutting Planes. CoRR abs/1703.02469 (2017) - [i9]Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Robert Robere, Jia Liang, Krzysztof Czarnecki, Vijay Ganesh:
Relating Complexity-theoretic Parameters with SAT Solver Performance. CoRR abs/1706.08611 (2017) - [i8]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. CoRR abs/1710.03219 (2017) - [i7]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. Electron. Colloquium Comput. Complex. TR17 (2017) - [i6]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random CNFs are Hard for Cutting Planes. Electron. Colloquium Comput. Complex. TR17 (2017) - [i5]Toniann Pitassi, Robert Robere:
Lifting Nullstellensatz to Monotone Span Programs over Any Field. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c6]Robert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook:
Exponential Lower Bounds for Monotone Span Programs. FOCS 2016: 406-415 - [i4]Stephen A. Cook, Toniann Pitassi, Robert Robere, Benjamin Rossman:
Exponential Lower Bounds for Monotone Span Programs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i3]Toniann Pitassi, Robert Robere:
Strongly Exponential Lower Bounds for Monotone Computation. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i2]Lalla Mouatadid, Robert Robere:
Path Graphs, Clique Trees, and Flowers. CoRR abs/1505.07702 (2015) - 2013
- [c5]Tarek Richard Besold
When Almost Is Not Even Close: Remarks on the Approximability of HDTP. AGI 2013: 11-20 - [c4]Tarek Richard Besold
A Note on Tractability and Artificial Intelligence. AGI 2013: 170-173 - [c3]Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook:
Average Case Lower Bounds for Monotone Switching Networks. FOCS 2013: 598-607 - [c2]Tarek R. Besold, Robert Robere:
When Thinking Never Comes to a Halt: Using Formal Methods in Making Sure Your AI Gets the Job Done Good Enough. PT-AI 2013: 43-62 - [i1]Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook:
Average Case Lower Bounds for Monotone Switching Networks. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c1]Robert Robere, Tarek Richard Besold
Complex Analogies: Remarks on the Complexity of HDTP. Australasian Conference on Artificial Intelligence 2012: 530-542
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 2024-12-10 20:42 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: