Ilario Bonacina

43 papers A* 5A 7B 2Misc 1Journal 27

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	An Algebraic Approach to MaxCSP. SAT Ilario Bonacina, Jordi Levy
2025	A	`conf`	Redundancy Rules for MaxSAT. SAT Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
2025	J	`jnl`	Redundancy rules for MaxSAT. CoRR Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
2025	A	`conf`	Semi-Algebraic Proof Systems for QBF. SAT Olaf Beyersdorff, Ilario Bonacina, Kaspar Kasche, Meena Mahajan, Luc Nicolas Spachmann
2025	J	`jnl`	Semi-Algebraic Proof Systems for QBF. CoRR Olaf Beyersdorff, Ilario Bonacina, Kaspar Kasche, Meena Mahajan, Luc Nicolas Spachmann
2025	J	`jnl`	Strength and limitations of Sherali-Adams and Nullstellensatz proof systems. Ann. Pure Appl. Log. Ilario Bonacina, Maria Luisa Bonet
2024	A	`conf`	MaxSAT Resolution with Inclusion Redundancy. SAT Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria
2024	J	`jnl`	Polynomial calculus for optimization. Artif. Intell. Ilario Bonacina, Maria Luisa Bonet, Jordi Levy
2024	J	`jnl`	Redundancy for MaxSAT. Electron. Colloquium Comput. Complex. Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria
2024	A*	`conf`	Weighted, Circular and Semi-Algebraic Proofs (Abstract Reprint). IJCAI Ilario Bonacina, Maria Luisa Bonet, Jordi Levy
2024	J	`jnl`	Weighted, Circular and Semi-Algebraic Proofs. J. Artif. Intell. Res. Ilario Bonacina, Maria Luisa Bonet, Jordi Levy
2023	J	`jnl`	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Comput. Complex. Ilario Bonacina, Nicola Galesi, Massimo Lauria
2023	A	`conf`	Polynomial Calculus for MaxSAT. SAT Ilario Bonacina, Maria Luisa Bonet, Jordi Levy
2022	J	`jnl`	A separation of PLS from PPP. Electron. Colloquium Comput. Complex. Ilario Bonacina, Neil Thapen
2022	B	`conf`	On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. MFCS Ilario Bonacina, Nicola Galesi, Massimo Lauria
2022	A*	`conf`	On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. LICS Ilario Bonacina, Maria Luisa Bonet
2022	J	`jnl`	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Electron. Colloquium Comput. Complex. Ilario Bonacina, Nicola Galesi, Massimo Lauria
2021	J	`jnl`	Clique Is Hard on Average for Regular Resolution. J. ACM Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2021	J	`jnl`	On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. Electron. Colloquium Comput. Complex. Ilario Bonacina, Maria Luisa Bonet
2020	J	`jnl`	Clique Is Hard on Average for Regular Resolution. CoRR Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2020	J	`jnl`	Frege Systems for Quantified Boolean Logic. J. ACM Olaf Beyersdorff, Ilario Bonacina, Leroy Chew, Ján Pich
2018	A*	`conf`	Clique is hard on average for regular resolution. STOC Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2017	—	`book`	Space in Weak Propositional Proof Systems Ilario Bonacina
2017	J	`jnl`	Space proof complexity for random 3-CNFs. Inf. Comput. Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
2017	J	`jnl`	Strong ETH and Resolution via Games and the Multiplicity of Strategies. Algorithmica Ilario Bonacina, Navid Talebanfard
2016	J	`jnl`	Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis. Inf. Process. Lett. Ilario Bonacina, Navid Talebanfard
2016	A	`conf`	Lower Bounds: From Circuits to QBF Proof Systems. ITCS Olaf Beyersdorff, Ilario Bonacina, Leroy Chew
2016	J	`jnl`	Space in weak propositional proof systems. Bull. EATCS Ilario Bonacina
2016	A*	`conf`	Total Space in Resolution Is at Least Width Squared. ICALP Ilario Bonacina
2016	J	`jnl`	Total Space in Resolution. SIAM J. Comput. Ilario Bonacina, Nicola Galesi, Neil Thapen
2016	J	`jnl`	Total space in Resolution is at least width squared. Electron. Colloquium Comput. Complex. Ilario Bonacina
2015	J	`jnl`	A Framework for Space Complexity in Algebraic Proof Systems. J. ACM Ilario Bonacina, Nicola Galesi
2015	J	`jnl`	Lower bounds: from circuits to QBF proof systems. Electron. Colloquium Comput. Complex. Olaf Beyersdorff, Ilario Bonacina, Leroy Chew
2015	J	`jnl`	Space proof complexity for random 3-CNFs. CoRR Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
2015	B	`conf`	Strong ETH and Resolution via Games and the Multiplicity of Strategies. IPEC Ilario Bonacina, Navid Talebanfard
2014	Misc	`conf`	Proofs of Space: When Space Is of the Essence. SCN Giuseppe Ateniese, Ilario Bonacina, Antonio Faonio, Nicola Galesi
2014	J	`jnl`	Space proof complexity for random $3$-CNFs via a $(2-ε)$-Hall's Theorem. CoRR Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan
2014	J	`jnl`	Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem. Electron. Colloquium Comput. Complex. Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan
2014	A*	`conf`	Total Space in Resolution. FOCS Ilario Bonacina, Nicola Galesi, Neil Thapen
2014	J	`jnl`	Total space in resolution. Electron. Colloquium Comput. Complex. Ilario Bonacina, Nicola Galesi, Neil Thapen
2013	J	`jnl`	Proofs of Space: When Space is of the Essence. IACR Cryptol. ePrint Arch. Giuseppe Ateniese, Ilario Bonacina, Antonio Faonio, Nicola Galesi
2013	A	`conf`	Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems. ITCS Ilario Bonacina, Nicola Galesi
2012	J	`jnl`	Pseudo-partitions, Transversality and Locality: A Combinatorial Characterization for the Space Measure in Algebraic Proof Systems. Electron. Colloquium Comput. Complex. Ilario Bonacina, Nicola Galesi