Sebastian Müller

Publication Activity (10 Years)

Years Active: 2005-2014
Publications (10 Years): 0

Top Topics

Randomly Generated

Graph Structure

Conjunctive Normal Form

Top Venues

Ann. Pure Appl. Log.

Electron. Colloquium Comput. Complex.

Log. Methods Comput. Sci.

Publications

Sebastian Müller, Iddo Tzameret
Short propositional refutations for dense random 3CNF formulas. Ann. Pure Appl. Log. 165 (12) (2014)
Sebastian Müller
Graph Structure and Parity Games. Electron. Colloquium Comput. Complex. 21 (2014)
Sebastian Müller
Polylogarithmic Cuts in Models of V^0 Log. Methods Comput. Sci. 9 (1) (2013)
Sebastian Müller, Iddo Tzameret
Short Propositional Refutations for Dense Random 3CNF Formulas. LICS (2012)
Olaf Beyersdorff, Johannes Köbler, Sebastian Müller
Proof systems that take advice. Inf. Comput. 209 (3) (2011)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof complexity of propositional default logic. Arch. Math. Log. 50 (7-8) (2011)
Sebastian Müller, Iddo Tzameret
Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas CoRR (2011)
Sebastian Müller, Iddo Tzameret
Average-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas. Electron. Colloquium Comput. Complex. 18 (2011)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games (2010)
Olaf Beyersdorff, Sebastian Müller
Different Approaches to Proof Systems. TAMC (2010)
Olaf Beyersdorff, Sebastian Müller
A tight Karp-Lipton collapse result in bounded arithmetic. ACM Trans. Comput. Log. 11 (4) (2010)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof Complexity of Propositional Default Logic. SAT (2010)
Olaf Beyersdorff, Johannes Köbler, Sebastian Müller
Nondeterministic Instance Complexity and Proof Systems with Advice. LATA (2009)
Olaf Beyersdorff, Johannes Köbler, Sebastian Müller
Proof Systems that Take Advice. Electron. Colloquium Comput. Complex. 16 (2009)
Olaf Beyersdorff, Sebastian Müller
Does Advice Help to Prove Propositional Tautologies? SAT (2009)
Olaf Beyersdorff, Sebastian Müller
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. CSL (2008)
Olaf Beyersdorff, Johannes Köbler, Sebastian Müller
Nondeterministic Instance Complexity and Proof Systems with Advice. Electron. Colloquium Comput. Complex. 15 (075) (2008)
Sebastian Müller, Arno Schödl
A Smart Algorithm for Column Chart Labeling. Smart Graphics (2005)