Ilario Bonacina
Title
Cited by
Cited by
Year
Proofs of space: When space is of the essence
G Ateniese, I Bonacina, A Faonio, N Galesi
International Conference on Security and Cryptography for Networks, 538-557, 2014
902014
Lower bounds: From circuits to QBF proof systems
O Beyersdorff, I Bonacina, C Leroy
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
432016
Total space in resolution.
I Bonacina, N Galesi, N Thapen
55th IEEE Symposium on Foundations of Computer Science (FOCS), 641-650, 2014
302014
A framework for space complexity in algebraic proof systems
I Bonacina, N Galesi
Journal of the ACM (JACM) 62 (3), 1-20, 2015
202015
Total space in resolution is at least width squared
I Bonacina
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
162016
Space proof complexity for random 3-CNFs
P Bennett, I Bonacina, N Galesi, T Huynh, M Molloy, P Wollan
Information and Computation 255, 165-176, 2017
152017
Pseudo-partitions, transversality and locality: A combinatorial characterization for the space measure in algebraic proof systems
I Bonacina, N Galesi
4th conference on Innovations in Theoretical Computer Science (ITCS), 455-472, 2013
142013
Clique is hard on average for regular resolution
A Atserias, I Bonacina, SF de Rezende, M Lauria, J Nordström, ...
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
102018
Space in weak propositional proof systems
I Bonacina
PhD thesis, Department of Computer Science, Sapienza University of Rome, 12 2015, 2015
52015
Space proof complexity for random -CNFs via a -Hall's Theorem
I Bonacina, N Galesi, T Huynh, P Wollan
arXiv preprint arXiv:1411.1619, 2014
52014
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis
I Bonacina, N Talebanfard
Information Processing Letters 116 (2), 120-124, 2016
42016
Strong ETH and Resolution via Games and the Multiplicity of Strategies
I Bonacina, N Talebanfard
Algorithmica 79 (1), 29-41, 2017
32017
SAT and Interactions (Dagstuhl Seminar 16381)
O Beyersdorff, N Creignou, U Egly, H Vollmer
Dagstuhl Reports 6 (9), 2017
12017
Improving Strong Exponential Time Hypothesis lower bounds for tree-like resolution
I Bonacina, N Talebanfard
2014
The system can't perform the operation now. Try again later.
Articles 1–14