Ilario Bonacina
Cytowane przez
Cytowane przez
Proofs of space: When space is of the essence
G Ateniese, I Bonacina, A Faonio, N Galesi
Security and Cryptography for Networks: 9th International Conference, SCN …, 2014
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
Total space in resolution.
I Bonacina, N Galesi, N Thapen
55th IEEE Symposium on Foundations of Computer Science (FOCS), 641-650, 2014
Clique is hard on average for regular resolution
A Atserias, I Bonacina, SF De Rezende, M Lauria, J Nordström, ...
Journal of the ACM (JACM) 68 (4), 1-26, 2021
A framework for space complexity in algebraic proof systems
I Bonacina, N Galesi
Journal of the ACM (JACM) 62 (3), 1-20, 2015
Total space in resolution is at least width squared
I Bonacina
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
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
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
Strong ETH and Resolution via Games and the Multiplicity of Strategies
I Bonacina, N Talebanfard
Algorithmica 79, 29-41, 2017
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
Space in weak propositional proof systems
I Bonacina
PhD thesis, Department of Computer Science, Sapienza University of Rome, 12 2015, 2015
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
SAT and Interactions (Dagstuhl Seminar 16381)
O Beyersdorff, N Creignou, U Egly, H Vollmer
Dagstuhl Reports 6 (9), 2017
Improving Strong Exponential Time Hypothesis lower bounds for tree-like resolution
I Bonacina, N Talebanfard
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–14