Robert Robere
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
- [c8]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. ITCS 2018: 10:1-10:20 - 2017
- [c7]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random Θ(log n)-CNFs Are Hard for Cutting Planes. FOCS 2017: 109-120 - [c6]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]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random CNFs are Hard for Cutting Planes. Electronic Colloquium on Computational Complexity (ECCC) 24: 45 (2017) - [i6]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. Electronic Colloquium on Computational Complexity (ECCC) 24: 151 (2017) - [i5]Toniann Pitassi, Robert Robere:
Lifting Nullstellensatz to Monotone Span Programs over Any Field. Electronic Colloquium on Computational Complexity (ECCC) 24: 165 (2017) - 2016
- [c5]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. Electronic Colloquium on Computational Complexity (ECCC) 23: 64 (2016) - [i3]Toniann Pitassi, Robert Robere:
Strongly Exponential Lower Bounds for Monotone Computation. Electronic Colloquium on Computational Complexity (ECCC) 23: 188 (2016) - 2015
- [i2]
- 2013
- [c4]Tarek Richard Besold, Robert Robere:
When Almost Is Not Even Close: Remarks on the Approximability of HDTP. AGI 2013: 11-20 - [c3]Tarek Richard Besold, Robert Robere:
A Note on Tractability and Artificial Intelligence. AGI 2013: 170-173 - [c2]Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook:
Average Case Lower Bounds for Monotone Switching Networks. FOCS 2013: 598-607 - [i1]Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook:
Average Case Lower Bounds for Monotone Switching Networks. Electronic Colloquium on Computational Complexity (ECCC) 20: 54 (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
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-01-24 21:08 CET by the dblp team