Volgen
Robert Robere
Robert Robere
Geverifieerd e-mailadres voor cs.mcgill.ca - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Exponential lower bounds for monotone span programs
R Robere, T Pitassi, B Rossman, SA Cook
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
552016
Lifting Nullstellensatz to monotone span programs over any field
T Pitassi, R Robere
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
452018
Strongly exponential lower bounds for monotone computation
T Pitassi, R Robere
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
412017
Interior point methods and linear programming
R Robere
University of Toronto, 1-15, 2012
412012
Adventures in monotone complexity and TFNP
M Göös, P Kamath, R Robere, D Sokolov
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018
332018
Stabbing planes
P Beame, N Fleming, R Impagliazzo, A Kolokolova, D Pankratov, T Pitassi, ...
arXiv preprint arXiv:1710.03219, 2017
232017
Random θ (log n)-CNFs are hard for cutting planes
N Fleming, D Pankratov, T Pitassi, R Robere
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
192017
Average case lower bounds for monotone switching networks
Y Filmus, T Pitassi, R Robere, SA Cook
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 598-607, 2013
172013
A dynamic algorithm for loop detection in software defined networks
D Kordalewski, R Robere
University of Toronto, Tech. Rep, 2012
152012
On the Power and Limitations of Branch and Cut
N Fleming, M Göös, R Impagliazzo, T Pitassi, R Robere, LY Tan, ...
arXiv preprint arXiv:2102.05019, 2021
112021
Unified lower bounds for monotone computation
R Robere
University of Toronto (Canada), 2018
112018
The proof complexity of SMT solvers
R Robere, A Kolokolova, V Ganesh
International Conference on Computer Aided Verification, 275-293, 2018
102018
Random CNFs are hard for cutting planes
N Fleming, D Pankratov, T Pitassi, R Robere
arXiv preprint arXiv:1703.02469, 2017
102017
KRW Composition Theorems via Lifting
SF de Rezende, O Meir, J Nordström, T Pitassi, R Robere
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 43-49, 2020
82020
Exponential Lower Bounds for Monotone Span Programs.
SA Cook, T Pitassi, R Robere, B Rossman
Electron. Colloquium Comput. Complex. 23, 64, 2016
82016
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
SF de Rezende, O Meir, J Nordström, R Robere
arXiv preprint arXiv:2001.02481, 2020
72020
Complex analogies: Remarks on the complexity of HDTP
R Robere, TR Besold
Australasian Joint Conference on Artificial Intelligence, 530-542, 2012
72012
Lifting with simple gadgets and applications to circuit and proof complexity
S de Rezende, O Meir, J Nordström, T Pitassi, R Robere, M Vinyals
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 24-30, 2020
62020
When almost is not even close: Remarks on the approximability of HDTP
TR Besold, R Robere
International Conference on Artificial General Intelligence, 11-20, 2013
62013
Learning-Sensitive Backdoors with Restarts
E Zulkoski, R Martins, CM Wintersteiger, R Robere, JH Liang, K Czarnecki, ...
International Conference on Principles and Practice of Constraint …, 2018
52018
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20