search result

Cover von 42nd International Symposium on Theoretical Aspects of Computer Science
STACS 2025, March 4-7, 2025, Jena, Germany
Search for this author
Year: 2025
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 327
Media group: LIPIcs
Cover von Polynomial Calculus for Quantified Boolean Logic

Polynomial Calculus for Quantified Boolean Logic

Lower Bounds Through Circuits and Degree
Year: 2024
Media group: LIPIcs
Cover von Front Matter, Table of Contents, Preface, Conference Organization

Front Matter, Table of Contents, Preface, Conference Organization

Year: 2024
Media group: LIPIcs
Cover von LIPIcs, Volume 289, STACS 2024, Complete Volume

LIPIcs, Volume 289, STACS 2024, Complete Volume

Year: 2024
Media group: LIPIcs
Cover von 41st International Symposium on Theoretical Aspects of Computer Science
STACS 2024, March 12-14, 2024, Clermont-Ferrand, France
Search for this author
Year: 2024
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 289
Media group: LIPIcs
Cover von Mathematics for Computation (M4C)
Search for this author
Year: 2023
Publisher: Singapore, World Scientific
Media group: MONOGRAPHIE
Cover von Theory and Practice of SAT and Combinatorial Solving; 10
pp. 84-105
Search for this author
Year: 2023
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 10
Media group: DAGSTUHL REPORT
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
OPEN V 11.1.0.0