search result

Cover von Classes of Hard Formulas for QBF Resolution

Classes of Hard Formulas for QBF Resolution

Year: 2022
Media group: LIPIcs
Cover von Non-classical Aspects in Proof Complexity
Author: Beyersdorff, Olaf Search for this author
Year: 2012
Publisher: Göttingen, Cuvillier
Media group: DISSERTATION
Cover von Edges as Nodes - a New Approach to Timetable Information

Edges as Nodes - a New Approach to Timetable Information

Year: 2009
Media group: ARTICLE
Cover von QCDCL vs QBF Resolution

QCDCL vs QBF Resolution

Further Insights
Year: 2023
Media group: LIPIcs
Cover von Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution

Year: 2021
Media group: LIPIcs
Cover von SAT and Interactions; 10,2
pp. 1-18
Search for this author
Year: 2020
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 10,2
Media group: DAGSTUHL REPORT
Cover von Theory and Applications of Satisfiability Testing
SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings
Search for this author
Year: 2018
Publisher: Heidelberg, Springer
Series: Lecture notes in computer science; 10929
Media group: MONOGRAPHIE
Cover von Genuine Lower Bounds for QBF Expansion

Genuine Lower Bounds for QBF Expansion

Year: 2018
Media group: LIPIcs
Cover von Size, Cost and Capacity

Size, Cost and Capacity

A Semantic Technique for Hard Random QBFs
Year: 2018
Media group: LIPIcs
Cover von Proof Complexity of Propositional Model Counting

Proof Complexity of Propositional Model Counting

Year: 2023
Media group: LIPIcs
OPEN V 11.1.0.0