Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2020
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer SciencePages 209–223https://doi.org/10.1145/3373718.3394793We provide a tight characterisation of proof size in resolution for quantified Boolean formulas (QBF) by circuit complexity. Such a characterisation was previously obtained for a hierarchy of QBF Frege systems (Beyersdorff & Pich, LICS 2016), but ...
- research-articleJuly 2020
The Surprising Power of Constant Depth Algebraic Proofs
LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer SciencePages 591–603https://doi.org/10.1145/3373718.3394754A major open problem in proof complexity is to prove superpolynomial lower bounds for AC0[p]-Frege proofs. This system is the analog of AC0 [p], the class of bounded depth circuits with prime modular counting gates. Despite strong lower bounds for this ...