Ilario Bonacina

MaRDI QIDQ894451zbMATH OpenDBLPWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
MaxSAT resolution with inclusion redundancy	2026-02-03	Paper
Polynomial calculus for optimization Artificial Intelligence	2025-01-17	Paper
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems	2024-12-06	Paper
Polynomial calculus for MaxSAT	2024-11-26	Paper
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares	2024-08-06	Paper
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares Computational Complexity	2024-01-24	Paper
Clique Is Hard on Average for Regular Resolution Journal of the ACM	2022-12-08	Paper
Frege systems for quantified Boolean logic Journal of the ACM	2020-11-11	Paper
Clique is hard on average for regular resolution Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing	2019-08-22	Paper
Total space in resolution is at least width squared	2017-12-19	Paper
Strong ETH and resolution via games and the multiplicity of strategies Algorithmica	2017-10-10	Paper
Strong ETH and resolution via games and the multiplicity of strategies	2017-09-29	Paper
Space proof complexity for random 3-CNFs Information and Computation	2017-08-08	Paper
Pseudo-partitions, transversality and locality, a combinatorial characterization for the space measure in algebraic proof systems Proceedings of the 4th conference on Innovations in Theoretical Computer Science	2017-05-16	Paper
Total space in resolution SIAM Journal on Computing	2016-10-28	Paper
Lower bounds: from circuits to QBF proof systems Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science	2016-04-15	Paper
A framework for space complexity in algebraic proof systems Journal of the ACM	2016-03-24	Paper
Improving resolution width lower bounds for \(k\)-CNFs with applications to the strong exponential time hypothesis Information Processing Letters	2015-12-01	Paper
Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem	2014-11-06	Paper
Proofs of space: when space is of the essence Lecture Notes in Computer Science	2014-10-14	Paper

Research outcomes over time

This page was built for person: Ilario Bonacina