# Robert Robere

According to our database

Collaborative distances:

^{1}, Robert Robere authored at least 20 papers between 2012 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.

Electronic Colloquium on Computational Complexity (ECCC), 2020

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.

CoRR, 2020

2019

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.

Electronic Colloquium on Computational Complexity (ECCC), 2019

Lower Bounds for (Non-monotone) Comparator Circuits.

Electronic Colloquium on Computational Complexity (ECCC), 2019

2018

Adventures in Monotone Complexity and TFNP.

Electronic Colloquium on Computational Complexity (ECCC), 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.

Electronic Colloquium on Computational Complexity (ECCC), 2017

Random CNFs are Hard for Cutting Planes.

Electronic Colloquium on Computational Complexity (ECCC), 2017

Stabbing Planes.

Electronic Colloquium on Computational Complexity (ECCC), 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.

Electronic Colloquium on Computational Complexity (ECCC), 2016

Exponential Lower Bounds for Monotone Span Programs.

Electronic Colloquium on Computational Complexity (ECCC), 2016

2015

Path Graphs, Clique Trees, and Flowers.

CoRR, 2015

2013

Average Case Lower Bounds for Monotone Switching Networks.

Electronic Colloquium on Computational Complexity (ECCC), 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