Robert Robere

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 64

Top Topics

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Yuhao Li, William Pires, Robert Robere
Intersection Classes in TFNP and Proof Complexity. ITCS (2024)
Siddhartha Jain, Jiawei Li, Robert Robere, Zhiyang Xun
On Pigeonhole Principles and Ramsey in TFNP. Electron. Colloquium Comput. Complex. (2024)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. Comput. Complex. 33 (1) (2024)
Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere
Black-Box PPP is not Turing-Closed. Electron. Colloquium Comput. Complex. (2024)
Siddhartha Jain, Jiawei Li, Robert Robere, Zhiyang Xun
On Pigeonhole Principles and Ramsey in TFNP. CoRR (2024)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Separations in Proof Complexity and TFNP. J. ACM 71 (4) (2024)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\). SIAM J. Comput. 53 (3) (2024)
Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere
Black-Box PPP Is Not Turing-Closed. STOC (2024)
Ben Davis, Robert Robere
Colourful TFNP and Propositional Proofs. CCC (2023)
Elette Boyle, Yuval Ishai, Pierre Meyer, Robert Robere, Gal Yehuda
On Low-End Obfuscation and Learning. ITCS (2023)
Ben Davis, Robert Robere
Colourful TFNP and Propositional Proofs. Electron. Colloquium Comput. Complex. (2023)
Noah Fleming, Mika Göös, Stefan Grosser, Robert Robere
On Semi-Algebraic Proofs and Algorithms. ITCS (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Further Collapses in TFNP. CoRR (2022)
Reyad Abed Elrazik, Robert Robere, Assaf Schuster, Gal Yehuda
Pseudorandom Self-Reductions for NP-Complete Problems. ITCS (2022)
Noah Fleming, Toniann Pitassi, Robert Robere
Extremely Deep Proofs. ITCS (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Separations in Proof Complexity and TFNP. FOCS (2022)
Susanna F. de Rezende, Mika Göös, Robert Robere
Proofs, Circuits, and Communication. CoRR (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Further Collapses in TFNP. CCC (2022)
Susanna F. de Rezende, Mika Göös, Robert Robere
Guest Column: Proofs, Circuits, and Communication. SIGACT News 53 (1) (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Further Collapses in TFNP. Electron. Colloquium Comput. Complex. 29 (2022)
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
Separations in Proof Complexity and TFNP. CoRR (2022)
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. (2022)
Noah Fleming, Stefan Grosser, Mika Göös, Robert Robere
On Semi-Algebraic Proofs and Algorithms. Electron. Colloquium Comput. Complex. 29 (2022)
Robert Robere, Jeroen Zuiddam
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. FOCS (2022)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. J. ACM 69 (3) (2022)
Reyad Abed Elrazik, Robert Robere, Assaf Schuster, Gal Yehuda
Pseudorandom Self-Reductions for NP-Complete Problems. Electron. Colloquium Comput. Complex. 28 (2021)
Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov
Automating algebraic proof systems is NP-hard. STOC (2021)
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 (2021)
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. 28 (2021)
Robert Robere, Jeroen Zuiddam
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. Electron. Colloquium Comput. Complex. 28 (2021)
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. Computational Complexity Conference (2021)
Robert Robere, Jeroen Zuiddam
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. FOCS (2021)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Comput. Complex. 30 (1) (2021)
Noah Fleming, Toniann Pitassi, Robert Robere
Extremely Deep Proofs. Electron. Colloquium Comput. Complex. 28 (2021)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. FOCS (2020)
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 (2020)
Anna Gál, Robert Robere
Lower Bounds for (Non-Monotone) Comparator Circuits. ITCS (2020)
Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Electron. Colloquium Comput. Complex. 27 (2020)
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. 27 (2020)
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. FOCS (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CoRR (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. CoRR (2020)
Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. 27 (2020)
Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Computational Complexity Conference (2019)
Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov
Adventures in Monotone Complexity and TFNP. ITCS (2019)
Anna Gál, Robert Robere
Lower Bounds for (Non-monotone) Comparator Circuits. Electron. Colloquium Comput. Complex. 26 (2019)
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. 26 (2019)
Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
Stabbing Planes. ITCS (2018)
Toniann Pitassi, Robert Robere
Lifting nullstellensatz to monotone span programs over any field. STOC (2018)
Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov
Adventures in Monotone Complexity and TFNP. Electron. Colloquium Comput. Complex. 25 (2018)
Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Robert Robere, Jia Hui Liang, Krzysztof Czarnecki, Vijay Ganesh
Learning-Sensitive Backdoors with Restarts. CP (2018)
Robert Robere, Antonina Kolokolova, Vijay Ganesh
The Proof Complexity of SMT Solvers. CAV (2) (2018)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random Θ(log n)-CNFs Are Hard for Cutting Planes. FOCS (2017)
Edward Zulkoski, Ruben Martins, Christoph M. Wintersteiger, Robert Robere, Jia Liang, Krzysztof Czarnecki, Vijay Ganesh
Relating Complexity-theoretic Parameters with SAT Solver Performance. CoRR (2017)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random CNFs are Hard for Cutting Planes. CoRR (2017)
Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
Stabbing Planes. Electron. Colloquium Comput. Complex. 24 (2017)
Toniann Pitassi, Robert Robere
Strongly exponential lower bounds for monotone computation. STOC (2017)
Toniann Pitassi, Robert Robere
Lifting Nullstellensatz to Monotone Span Programs over Any Field. Electron. Colloquium Comput. Complex. 24 (2017)
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
Random CNFs are Hard for Cutting Planes. Electron. Colloquium Comput. Complex. 24 (2017)
Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
Stabbing Planes. CoRR (2017)
Stephen A. Cook, Toniann Pitassi, Robert Robere, Benjamin Rossman
Exponential Lower Bounds for Monotone Span Programs. Electron. Colloquium Comput. Complex. 23 (2016)
Toniann Pitassi, Robert Robere
Strongly Exponential Lower Bounds for Monotone Computation. Electron. Colloquium Comput. Complex. 23 (2016)
Robert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook
Exponential Lower Bounds for Monotone Span Programs. FOCS (2016)
Lalla Mouatadid, Robert Robere
Path Graphs, Clique Trees, and Flowers. CoRR (2015)
Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook
Average Case Lower Bounds for Monotone Switching Networks. FOCS (2013)
Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook
Average Case Lower Bounds for Monotone Switching Networks. Electron. Colloquium Comput. Complex. 20 (2013)
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)
Tarek Richard Besold, Robert Robere
When Almost Is Not Even Close: Remarks on the Approximability of HDTP. AGI (2013)
Tarek Richard Besold, Robert Robere
A Note on Tractability and Artificial Intelligence. AGI (2013)
Robert Robere, Tarek Richard Besold
Complex Analogies: Remarks on the Complexity of HDTP. Australasian Conference on Artificial Intelligence (2012)