search result

Cover von A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds

A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds

Year: 2015
Media group: LIPIcs
Cover von Front Matter, Table of Contents, Preface, Conference Organization

Front Matter, Table of Contents, Preface, Conference Organization

Year: 2025
Media group: LIPIcs
Cover von LIPIcs, Volume 341, SAT 2025, Complete Volume

LIPIcs, Volume 341, SAT 2025, Complete Volume

Year: 2025
Media group: LIPIcs
Cover von 28th International Conference on Theory and Applications of Satisfiability Testing
SAT 2025, August 12-15, 2025, Glasgow, Scotland
Search for this author
Year: 2025
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 341
Media group: LIPIcs
Cover von Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases

Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases

Year: 2017
Media group: LIPIcs
Cover von Supercritical Space-Width Trade-Offs for Resolution

Supercritical Space-Width Trade-Offs for Resolution

Year: 2016
Media group: LIPIcs
Cover von Tight Size-Degree Bounds for Sums-of-Squares Proofs

Tight Size-Degree Bounds for Sums-of-Squares Proofs

Year: 2015
Media group: LIPIcs
Cover von Trade-Offs Between Size and Degree in Polynomial Calculus

Trade-Offs Between Size and Degree in Polynomial Calculus

Year: 2020
Media group: LIPIcs
Cover von Pseudo-Boolean Proof Logging for Optimal Classical Planning
article in Proceedings of the Thirty-Fifth International Conference on Automated Planning and Scheduling (ICAPS2025)
Search for this author
Year: 2025
Publisher: Menlo Park, AAAI Press
Media group: ARTICLE
Cover von Practically Feasible Proof Logging for Pseudo-Boolean Optimization

Practically Feasible Proof Logging for Pseudo-Boolean Optimization

Year: 2025
Media group: LIPIcs
OPEN V 11.1.0.0