Samuel R. Buss

According to our database, Samuel R. Buss authored at least 110 papers between 1985 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Regular resolution effectively simulates resolution.

Sam Buss, Emre Yolcu

Electron. Colloquium Comput. Complex., 2024

A Simple Supercritical Tradeoff between Size and Height in Resolution.

Sam Buss, Neil Thapen

Electron. Colloquium Comput. Complex., 2024

Redundancy for MaxSAT.

Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria

Electron. Colloquium Comput. Complex., 2024

2023

On the Consistency of Circuit Lower Bounds for Non-deterministic Time.

Albert Atserias, Sam Buss, Moritz Müller

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Polynomially Verifiable Arithmetic.

Sam Buss

Proceedings of the Logic, 2023

2022

TFNP Characterizations of Proof Systems and Monotone Circuits.

Sam Buss, Noah Fleming, Russell Impagliazzo

Electron. Colloquium Comput. Complex., 2022

2021

Proof Complexity and SAT Solving.

Sam Buss, Jakob Nordström

Proceedings of the Handbook of Satisfiability - Second Edition, 2021

Lower Bounds on OBDD Proofs with Several Orders.

Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov

ACM Trans. Comput. Log., 2021

DRAT and Propagation Redundancy Proofs Without New Variables.

Sam Buss, Neil Thapen

Log. Methods Comput. Sci., 2021

Propositional proof systems based on maximum satisfiability.

Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, António Morgado, João Marques-Silva

Artif. Intell., 2021

2020

2-D Tucker is PPA complete.

James Aisenberg, Maria Luisa Bonet, Sam Buss

J. Comput. Syst. Sci., 2020

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs.

Sam Buss, Anupam Das, Alexander Knop

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Feasible set functions have small circuits.

Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen

Comput., 2019

On transformations of constant depth propositional proofs.

Arnold Beckmann, Sam Buss

Ann. Pure Appl. Log., 2019

Strategies for Stable Merge Sorting.

Sam Buss, Alexander Knop

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

DRMaxSAT with MaxHS: First Contact.

António Morgado, Alexey Ignatiev, Maria Luisa Bonet, João Marques-Silva, Sam Buss

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

DRAT Proofs, Propagation Redundancy, and Extended Resolution.

Sam Buss, Neil Thapen

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018

Short refutations for an equivalence-chain principle for constant-depth formulas.

Sam Buss, Ramyaa Ramyaa

Math. Log. Q., 2018

Short proofs of the Kneser-Lovász coloring principle.

James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate

Inf. Comput., 2018

Reordering Rule Makes OBDD Proof Systems Stronger.

Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov

Electron. Colloquium Comput. Complex., 2018

MaxSAT Resolution With the Dual Rail Encoding.

Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, João Marques-Silva, António Morgado

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

The NP Search Problems of Frege and Extended Frege Proofs.

Arnold Beckmann, Sam Buss

ACM Trans. Comput. Log., 2017

Uniform proofs of ACC representations.

Sam Buss

Arch. Math. Log., 2017

Expander Construction in VNC1.

Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Injection Structures Specified by Finite State Transducers.

Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel

Proceedings of the Computability and Complexity, 2017

2016

Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Sets.

James Aisenberg, Maria Luisa Bonet, Sam Buss

J. Symb. Log., 2016

On Linear Resolution.

Sam Buss, Jan Johannsen

J. Satisf. Boolean Model. Comput., 2016

Expander Construction in VNC¹.

Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký

Electron. Colloquium Comput. Complex., 2016

Cobham recursive set functions.

Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen

Ann. Pure Appl. Log., 2016

2015

Quasipolynomial size proofs of the propositional pigeonhole principle.

Sam Buss

Theor. Comput. Sci., 2015

Book Review: Matthias Baaz and Alexander Leitsch, Methods of Cut-Elimination.

Sam Buss

Stud Logica, 2015

Safe Recursive Set Functions.

Arnold Beckmann, Samuel R. Buss, Sy-David Friedman

J. Symb. Log., 2015

Limits on Alternation Trading Proofs for Time-Space Lower Bounds.

Samuel R. Buss, Ryan Williams

Comput. Complex., 2015

Propositional Proofs in Frege and Extended Frege Systems (Abstract).

Sam Buss

Proceedings of the Computer Science - Theory and Applications, 2015

2014

Improved witnessing and local improvement principles for second-order bounded arithmetic.

Arnold Beckmann, Samuel R. Buss

ACM Trans. Comput. Log., 2014

Fragments of Approximate Counting.

Samuel R. Buss, Leszek Aleksander Kolodziejczyk, Neil Thapen

J. Symb. Log., 2014

Unshuffling a square is NP-hard.

Sam Buss, Michael Soltys

J. Comput. Syst. Sci., 2014

Improved Separations of Regular Resolution from Clause Learning Proof Systems.

Maria Luisa Bonet, Sam Buss, Jan Johannsen

J. Artif. Intell. Res., 2014

Small Stone in Pool.

Samuel R. Buss, Leszek Aleksander Kolodziejczyk

Log. Methods Comput. Sci., 2014

Sub-computable Boundedness Randomness.

Sam Buss, Douglas Cenzer, Jeffrey B. Remmel

Log. Methods Comput. Sci., 2014

2013

Probabilistic algorithmic randomness.

Sam Buss, Mia Minnes

J. Symb. Log., 2013

Computability in Europe 2011.

Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov

Ann. Pure Appl. Log., 2013

Alternation Trading Proofs and Their Limitations.

Sam Buss

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (Extended Abstract).

Maria Luisa Bonet, Sam Buss

Proceedings of the IJCAI 2013, 2013

3-D Computer Graphics.

Samuel R. Buss

Cambridge University Press, ISBN: 978-0-521-82103-2, 2013

2012

Sharpened lower bounds for cut elimination.

Samuel R. Buss

J. Symb. Log., 2012

Lower complexity bounds in justification logic.

Samuel R. Buss, Roman Kuznets

Ann. Pure Appl. Log., 2012

Propositional proofs and reductions between NP search problems.

Samuel R. Buss, Alan S. Johnson

Ann. Pure Appl. Log., 2012

Towards NP-P via proof complexity and search.

Samuel R. Buss

Ann. Pure Appl. Log., 2012

Computability in Europe 2009.

Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe

Ann. Pure Appl. Log., 2012

An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning.

Maria Luisa Bonet, Samuel R. Buss

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

2011

Corrected upper bounds for free-cut elimination.

Arnold Beckmann, Samuel R. Buss

Theor. Comput. Sci., 2011

Strong isomorphism reductions in complexity theory.

Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman, Moritz Müller

J. Symb. Log., 2011

2010

The quantifier complexity of polynomial-size iterated definitions in first-order logic.

Samuel R. Buss, Alan S. Johnson

Math. Log. Q., 2010

2009

Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic.

Arnold Beckmann, Samuel R. Buss

J. Math. Log., 2009

Preface.

Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi

Ann. Pure Appl. Log., 2009

Pool resolution is NP-hard to recognize.

Samuel R. Buss

Arch. Math. Log., 2009

Efficient Large-Scale Sweep and Prune Methods with AABB Insertion and Removal.

Daniel J. Tracy, Samuel R. Buss, Bryan M. Woods

Proceedings of the IEEE Virtual Reality Conference 2009 (VR 2009), 2009

The NP-Completeness of Reflected Fragments of Justification Logics.

Samuel R. Buss, Roman Kuznets

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2008

The NP-hardness of finding a directed acyclic graph for regular resolution.

Samuel R. Buss, Jan Hoffmann

Theor. Comput. Sci., 2008

Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning.

Samuel R. Buss, Jan Hoffmann, Jan Johannsen

Log. Methods Comput. Sci., 2008

2006

Polynomial-size Frege and resolution proofs of <i>st</i>-connectivity and Hex tautologies.

Samuel R. Buss

Theor. Comput. Sci., 2006

2005

Collision detection with relative screw motion.

Samuel R. Buss

Vis. Comput., 2005

Selectively Damped Least Squares for Inverse Kinematics.

Samuel R. Buss, Jin-Su Kim

J. Graph. Tools, 2005

Separation results for the size of constant-depth propositional proofs.

Arnold Beckmann, Samuel R. Buss

Ann. Pure Appl. Log., 2005

2004

A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution.

Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo

SIAM J. Comput., 2004

2003

Ordinal notations and well-orderings in bounded arithmetic.

Arnold Beckmann, Chris Pollett, Samuel R. Buss

Ann. Pure Appl. Log., 2003

Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223].

Arnold Beckmann, Samuel R. Buss, Chris Pollett

Ann. Pure Appl. Log., 2003

2002

Resource-bounded continuity and sequentiality for type-two functionals.

Samuel R. Buss, Bruce M. Kapron

ACM Trans. Comput. Log., 2002

2001

Spherical averages and applications to spherical splines and interpolation.

Samuel R. Buss, Jay P. Fillmore

ACM Trans. Graph., 2001

Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate.

Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi

J. Symb. Log., 2001

Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes.

Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi

J. Comput. Syst. Sci., 2001

The prospects for mathematical logic in the twenty-first century.

Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore

Bull. Symb. Log., 2001

On the computational content of intuitionistic propositional proofs.

Samuel R. Buss, Pavel Pudlák

Ann. Pure Appl. Log., 2001

2000

Incompleteness of Behavioral Logics.

Samuel R. Buss, Grigore Rosu

Proceedings of the Coalgebraic Methods in Computer Science, 2000

1999

The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic.

Samuel R. Buss, Grigori Mints

Ann. Pure Appl. Log., 1999

Bounded Arithmetic, Proof Complexity and Two Papers of Parikh.

Samuel R. Buss

Ann. Pure Appl. Log., 1999

Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract).

Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

Linear and <i>O</i>(<i>n</i> log <i>n</i>) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours.

Samuel R. Buss, Peter N. Yianilos

SIAM J. Comput., 1998

Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle.

Samuel R. Buss, Toniann Pitassi

J. Comput. Syst. Sci., 1998

1997

Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting.

Samuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jirí Sgall

Comput. Complex., 1997

Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization.

Samuel R. Buss

Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

Resolution and the Weak Pigeonhole Principle.

Samuel R. Buss, Toniann Pitassi

Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996

Cutting planes, connectivity, and threshold logic.

Samuel R. Buss, Peter Clote

Arch. Math. Log., 1996

Lower bounds on Nullstellensatz proofs via designs.

Samuel R. Buss

Proceedings of the Proof Complexity and Feasible Arithmetics, 1996

1995

The Serial Transitive Closure Problem for Trees.

Maria Luisa Bonet, Samuel R. Buss

SIAM J. Comput., 1995

Unprovability of Consistency Statements in Fragments of Bounded Arithmetic.

Samuel R. Buss, Aleksandar Ignjatovic

Ann. Pure Appl. Log., 1995

Relating the Bounded Arithmetic and Polynomial Time Hierarchies.

Samuel R. Buss

Ann. Pure Appl. Log., 1995

Some remarks on lengths of propositional proofs.

Samuel R. Buss

Arch. Math. Log., 1995

1994

On Gödel's Theorems on Lenghts of Proofs I: Number of Lines and Speedup for Arithmetics.

Samuel R. Buss

J. Symb. Log., 1994

Size-Depth Tradeoffs for Boolean Fomulae.

Maria Luisa Bonet, Samuel R. Buss

Inf. Process. Lett., 1994

Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours.

Samuel R. Buss, Peter N. Yianilos

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

On Herbrand's Theorem.

Samuel R. Buss

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus.

Pavel Pudlák, Samuel R. Buss

Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1993

The Deduction Rule and Linear and Near-Linear Proof Simulations.

Maria Luisa Bonet, Samuel R. Buss

J. Symb. Log., 1993

Intuitionistic Validity in T-Normal Kripke Structures.

Samuel R. Buss

Ann. Pure Appl. Log., 1993

1992

An Optimal Parallel Algorithm for Formula Evaluation.

Samuel R. Buss, Stephen A. Cook, A. Gupta, V. Ramachandran

SIAM J. Comput., 1992

The Graph of Multiplication is Equivalent to Counting.

Samuel R. Buss

Inf. Process. Lett., 1992

1991

On Truth-Table Reducibility to SAT

Samuel R. Buss, Louise Hay

Inf. Comput., March, 1991

On the Predictability of Coupled Automata: An Allegory about Chaos.

Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis

Complex Syst., 1991

The Undecidability of k-Provability.

Samuel R. Buss

Ann. Pure Appl. Log., 1991

Propositional Consistency Proofs.

Samuel R. Buss

Ann. Pure Appl. Log., 1991

On the Deduction Rule and the Number of Proof Lines

Maria Luisa Bonet, Samuel R. Buss

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1990

The Modal Logic of Pure Provability.

Samuel R. Buss

Notre Dame J. Formal Log., 1990

1988

Resolution Proofs of Generalized Pigeonhole Principles.

Samuel R. Buss, György Turán

Theor. Comput. Sci., 1988

On truth-table reducibility to SAT and the difference hierarchy over NP.

Samuel R. Buss, Louise Hay

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1987

Polynomial Size Proofs of the Propositional Pigeonhole Principle.

Samuel R. Buss

J. Symb. Log., 1987

The Boolean Formula Value Problem Is in ALOGTIME

Samuel R. Buss

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986

The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic.

Samuel R. Buss

Proceedings of the Structure in Complexity Theory, 1986

1985

The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract)

Samuel R. Buss

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985