Lower Bounds
From MaRDI portal
Publication:2800571
DOI10.1145/2840728.2840740zbMath1334.68084OpenAlexW2144319750WikidataQ59895095 ScholiaQ59895095MaRDI QIDQ2800571
Chew Leroy, Olaf Beyersdorff, Ilario Bonacina
Publication date: 15 April 2016
Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2840728.2840740
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution ⋮ Unnamed Item ⋮ Relating size and width in variants of Q-resolution ⋮ Lower Bound Techniques for QBF Proof Systems ⋮ Unnamed Item ⋮ A game characterisation of tree-like Q-resolution size ⋮ Unnamed Item ⋮ Lower bound techniques for QBF expansion ⋮ Characterising tree-like Frege proofs for QBF ⋮ Unnamed Item ⋮ Understanding cutting planes for QBFs ⋮ Building strategies into QBF proofs ⋮ Lifting QBF Resolution Calculi to DQBF ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ How QBF expansion makes strategy extraction hard
This page was built for publication: Lower Bounds
