Ilario Bonacina

Orcid: 0000-0002-5697-8070

Affiliations:
  • Universitat Politecnica de Catalunya, Barcelona, Spain


According to our database1, Ilario Bonacina authored at least 24 papers between 2012 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
1
3
1
1
2
1
2
4
2
1
1
1
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Strength and limitations of Sherali-Adams and Nullstellensatz proof systems.
Ann. Pure Appl. Log., 2025

2024
Weighted, Circular and Semi-Algebraic Proofs.
J. Artif. Intell. Res., 2024

Redundancy for MaxSAT.
Electron. Colloquium Comput. Complex., 2024

Polynomial calculus for optimization.
Artif. Intell., 2024

MaxSAT Resolution with Inclusion Redundancy.
Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

Weighted, Circular and Semi-Algebraic Proofs (Abstract Reprint).
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares.
Comput. Complex., December, 2023

Polynomial Calculus for MaxSAT.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

2022
A separation of PLS from PPP.
Electron. Colloquium Comput. Complex., 2022

2021
Clique Is Hard on Average for Regular Resolution.
J. ACM, 2021

On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems.
Electron. Colloquium Comput. Complex., 2021

2020
Frege Systems for Quantified Boolean Logic.
J. ACM, 2020

2017
Space proof complexity for random 3-CNFs.
Inf. Comput., 2017

Strong ETH and Resolution via Games and the Multiplicity of Strategies.
Algorithmica, 2017

Space in Weak Propositional Proof Systems
Springer, ISBN: 978-3-319-73452-1, 2017

2016
Total Space in Resolution.
SIAM J. Comput., 2016

Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis.
Inf. Process. Lett., 2016

Total space in Resolution is at least width squared.
Electron. Colloquium Comput. Complex., 2016

Space in weak propositional proof systems.
Bull. EATCS, 2016

2015
A Framework for Space Complexity in Algebraic Proof Systems.
J. ACM, 2015

Lower bounds: from circuits to QBF proof systems.
Electron. Colloquium Comput. Complex., 2015

2014
Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem.
Electron. Colloquium Comput. Complex., 2014

2013
Proofs of Space: When Space is of the Essence.
IACR Cryptol. ePrint Arch., 2013

2012
Pseudo-partitions, Transversality and Locality: A Combinatorial Characterization for the Space Measure in Algebraic Proof Systems.
Electron. Colloquium Comput. Complex., 2012


  Loading...