The following pages link to Ilario Bonacina (Q894451):
Displayed 15 items.
- Improving resolution width lower bounds for \(k\)-CNFs with applications to the strong exponential time hypothesis (Q894453) (← links)
- Space proof complexity for random 3-CNFs (Q2013560) (← links)
- Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
- A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
- Lower Bounds (Q2800571) (← links)
- Total Space in Resolution (Q2829448) (← links)
- Proofs of Space: When Space Is of the Essence (Q2922680) (← links)
- Pseudo-partitions, transversality and locality (Q2986893) (← links)
- Total Space in Resolution Is at Least Width Squared (Q4598195) (← links)
- Clique Is Hard on Average for Regular Resolution (Q5056413) (← links)
- Frege Systems for Quantified Boolean Logic (Q5133965) (← links)
- Clique is hard on average for regular resolution (Q5230344) (← links)
- Strong ETH and Resolution via Games and the Multiplicity of Strategies. (Q5363779) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
- Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem (Q6256182) (← links)