search result

Cover von Computational Complexity of Discrete Problems; 3
pp. 56-76
Search for this author
Year: 2025
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 3
Media group: DAGSTUHL REPORT
Cover von Semi-Algebraic Proof Systems for QBF

Semi-Algebraic Proof Systems for QBF

Year: 2025
Media group: LIPIcs
Cover von SAT and Interactions; 10
pp. 22-38
Search for this author
Year: 2025
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 10
Media group: DAGSTUHL REPORT
Cover von Computational Complexity of Discrete Problems; 3
pp. 17-31
Search for this author
Year: 2023
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 3
Media group: DAGSTUHL REPORT
Cover von Computational Complexity of Discrete Problems; 2
pp. 1-16
Search for this author
Year: 2021
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 2
Media group: DAGSTUHL REPORT
Cover von Algebraic Branching Programs, Border Complexity, and Tangent Spaces

Algebraic Branching Programs, Border Complexity, and Tangent Spaces

Year: 2020
Media group: LIPIcs
Cover von Short Proofs in QBF Expansion
Search for this author
Year: 2018
Publisher: Haifa, Electronic Colloquium on Computational Complexity
Series: Electronic Colloquium on Computational Complexity Report; 102
Media group: ARTICLE
Cover von Understanding Cutting Planes for QBFs

Understanding Cutting Planes for QBFs

Year: 2016
Media group: LIPIcs
Cover von Are Short Proofs Narrow?

Are Short Proofs Narrow?

QBF Resolution is not Simple
Year: 2016
Media group: LIPIcs
Cover von Circuits, Logic and Games; 9
pp. 105-124
Search for this author
Year: 2016
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 9
Media group: DAGSTUHL REPORT
OPEN V 11.1.0.0