Author:
Beyersdorff Olaf,Blinkhorn Joshua
Funder
John Templeton Foundation
Carl-Zeiss-Stiftung
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference28 articles.
1. Proof Complexity;Krajíček,2019
2. The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17);Pulina;Artif. Intell.,2019
3. A survey on applications of quantified Boolean formulas;Shukla,2019
4. Frege systems for quantified Boolean logic;Beyersdorff;J. ACM,2020
5. Hardness characterisations and size-width lower bounds for QBF resolution;Beyersdorff,2020
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. QBFFam: A Tool for Generating QBF Families from Proof Complexity;Theory and Applications of Satisfiability Testing – SAT 2021;2021