Robert Robere

Orcid: 0000-0002-6065-6023

According to our database1, Robert Robere authored at least 39 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
KRW Composition Theorems via Lifting.
Comput. Complex., June, 2024

Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\).
SIAM J. Comput., 2024

Black-Box PPP is not Turing-Closed.
Electron. Colloquium Comput. Complex., 2024

On Pigeonhole Principles and Ramsey in TFNP.
Electron. Colloquium Comput. Complex., 2024

Intersection Classes in TFNP and Proof Complexity.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Colourful TFNP and Propositional Proofs.
Electron. Colloquium Comput. Complex., 2023

On Low-End Obfuscation and Learning.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Guest Column: Proofs, Circuits, and Communication.
SIGACT News, 2022

Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes.
J. ACM, 2022

Separations in Proof Complexity and TFNP.
Electron. Colloquium Comput. Complex., 2022

Further Collapses in TFNP.
Electron. Colloquium Comput. Complex., 2022

On Semi-Algebraic Proofs and Algorithms.
Electron. Colloquium Comput. Complex., 2022

Proofs, Circuits, and Communication.
CoRR, 2022

2021
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms.
Electron. Colloquium Comput. Complex., 2021

Extremely Deep Proofs.
Electron. Colloquium Comput. Complex., 2021

On the Power and Limitations of Branch and Cut.
Electron. Colloquium Comput. Complex., 2021

Pseudorandom Self-Reductions for NP-Complete Problems.
Electron. Colloquium Comput. Complex., 2021

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.
Comput. Complex., 2021

2020
Automating Algebraic Proof Systems is NP-Hard.
Electron. Colloquium Comput. Complex., 2020

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.
Electron. Colloquium Comput. Complex., 2019

Lower Bounds for (Non-monotone) Comparator Circuits.
Electron. Colloquium Comput. Complex., 2019

2018
Unified Lower Bounds for Monotone Computation.
PhD thesis, 2018

Adventures in Monotone Complexity and TFNP.
Electron. Colloquium Comput. Complex., 2018

Learning-Sensitive Backdoors with Restarts.
Proceedings of the Principles and Practice of Constraint Programming, 2018

The Proof Complexity of SMT Solvers.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Lifting Nullstellensatz to Monotone Span Programs over Any Field.
Electron. Colloquium Comput. Complex., 2017

Random CNFs are Hard for Cutting Planes.
Electron. Colloquium Comput. Complex., 2017

Stabbing Planes.
Electron. Colloquium Comput. Complex., 2017

Relating Complexity-theoretic Parameters with SAT Solver Performance.
CoRR, 2017

Random Θ(log n)-CNFs Are Hard for Cutting Planes.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Strongly Exponential Lower Bounds for Monotone Computation.
Electron. Colloquium Comput. Complex., 2016

Exponential Lower Bounds for Monotone Span Programs.
Electron. Colloquium Comput. Complex., 2016

2015
Path Graphs, Clique Trees, and Flowers.
CoRR, 2015

2013
Average Case Lower Bounds for Monotone Switching Networks.
Electron. Colloquium Comput. Complex., 2013

When Thinking Never Comes to a Halt: Using Formal Methods in Making Sure Your AI Gets the Job Done Good Enough.
Proceedings of the Fundamental Issues of Artificial Intelligence, 2013

A Note on Tractability and Artificial Intelligence.
Proceedings of the Artificial General Intelligence - 6th International Conference, 2013

When Almost Is Not Even Close: Remarks on the Approximability of HDTP.
Proceedings of the Artificial General Intelligence - 6th International Conference, 2013

2012
Complex Analogies: Remarks on the Complexity of HDTP.
Proceedings of the AI 2012: Advances in Artificial Intelligence, 2012


  Loading...