Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlario Bonacina
Person information
- affiliation: Universitat Politecnica de Catalunya, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
[b1]Ilario Bonacina
:
Space in Weak Propositional Proof Systems. Springer 2017, ISBN 978-3-319-73452-1, pp. 1-130
Journal Articles
- 2024
- [j10]Ilario Bonacina, Maria Luisa Bonet, Jordi Levy:
Weighted, Circular and Semi-Algebraic Proofs. J. Artif. Intell. Res. 79: 447-482 (2024) - 2023
- [j9]Ilario Bonacina, Nicola Galesi, Massimo Lauria:
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Comput. Complex. 32(2): 12 (2023) - 2021
- [j8]Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
Clique Is Hard on Average for Regular Resolution. J. ACM 68(4): 23:1-23:26 (2021) - 2020
- [j7]Olaf Beyersdorff, Ilario Bonacina, Leroy Chew, Ján Pich:
Frege Systems for Quantified Boolean Logic. J. ACM 67(2): 9:1-9:36 (2020) - 2017
- [j6]Ilario Bonacina, Navid Talebanfard:
Strong ETH and Resolution via Games and the Multiplicity of Strategies. Algorithmica 79(1): 29-41 (2017) - [j5]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. Inf. Comput. 255: 165-176 (2017) - 2016
- [j4]Ilario Bonacina:
Space in weak propositional proof systems. Bull. EATCS 120 (2016) - [j3]Ilario Bonacina, Navid Talebanfard:
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis. Inf. Process. Lett. 116(2): 120-124 (2016) - [j2]Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total Space in Resolution. SIAM J. Comput. 45(5): 1894-1909 (2016) - 2015
- [j1]Ilario Bonacina, Nicola Galesi:
A Framework for Space Complexity in Algebraic Proof Systems. J. ACM 62(3): 23:1-23:20 (2015)
Conference and Workshop Papers
- 2024
- [c11]Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria:
MaxSAT Resolution with Inclusion Redundancy. SAT 2024: 7:1-7:15 - 2023
- [c10]Ilario Bonacina, Maria Luisa Bonet, Jordi Levy:
Polynomial Calculus for MaxSAT. SAT 2023: 5:1-5:17 - 2022
- [c9]Ilario Bonacina, Maria Luisa Bonet:
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. LICS 2022: 25:1-25:12 - [c8]Ilario Bonacina, Nicola Galesi, Massimo Lauria:
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. MFCS 2022: 23:1-23:15 - 2018
- [c7]Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
Clique is hard on average for regular resolution. STOC 2018: 866-877 - 2016
- [c6]Ilario Bonacina:
Total Space in Resolution Is at Least Width Squared. ICALP 2016: 56:1-56:13 - [c5]Olaf Beyersdorff, Ilario Bonacina, Leroy Chew:
Lower Bounds: From Circuits to QBF Proof Systems. ITCS 2016: 249-260 - 2015
- [c4]Ilario Bonacina, Navid Talebanfard:
Strong ETH and Resolution via Games and the Multiplicity of Strategies. IPEC 2015: 248-257 - 2014
- [c3]Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total Space in Resolution. FOCS 2014: 641-650 - [c2]Giuseppe Ateniese, Ilario Bonacina, Antonio Faonio, Nicola Galesi:
Proofs of Space: When Space Is of the Essence. SCN 2014: 538-557 - 2013
- [c1]Ilario Bonacina, Nicola Galesi:
Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems. ITCS 2013: 455-472
Informal and Other Publications
- 2024
- [i13]Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria:
Redundancy for MaxSAT. Electron. Colloquium Comput. Complex. TR24 (2024) - 2022
- [i12]Ilario Bonacina, Nicola Galesi, Massimo Lauria:
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Electron. Colloquium Comput. Complex. TR22 (2022) - [i11]Ilario Bonacina, Neil Thapen:
A separation of PLS from PPP. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i10]Ilario Bonacina, Maria Luisa Bonet:
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i9]Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
Clique Is Hard on Average for Regular Resolution. CoRR abs/2012.09476 (2020) - 2016
- [i8]Ilario Bonacina:
Total space in Resolution is at least width squared. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i7]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. CoRR abs/1503.01613 (2015) - [i6]Olaf Beyersdorff, Ilario Bonacina, Leroy Chew:
Lower bounds: from circuits to QBF proof systems. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i5]Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan:
Space proof complexity for random $3$-CNFs via a $(2-ε)$-Hall's Theorem. CoRR abs/1411.1619 (2014) - [i4]Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan:
Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem. Electron. Colloquium Comput. Complex. TR14 (2014) - [i3]Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total space in resolution. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i2]Giuseppe Ateniese, Ilario Bonacina, Antonio Faonio, Nicola Galesi:
Proofs of Space: When Space is of the Essence. IACR Cryptol. ePrint Arch. 2013: 805 (2013) - 2012
- [i1]Ilario Bonacina, Nicola Galesi:
Pseudo-partitions, Transversality and Locality: A Combinatorial Characterization for the Space Measure in Algebraic Proof Systems. Electron. Colloquium Comput. Complex. TR12 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
