Samuel R. Buss

发表

Linear gaps between degrees for the polynomial calculus modulo distinct primes

Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Logic Colloquium '98 : proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, held in Prague, Czech Republic August 9-15, 1998

Samuel R. Buss, Petr Hájek, Pavel Pudlák, 2016 .

Bounded Arithmetic, Proof Complexity and Two Papers of Parikh

Samuel R. Buss, S. Buss, 1999, Ann. Pure Appl. Log..

On the computational content of intuitionistic propositional proofs

Samuel R. Buss, Pavel Pudlák, 2001, Ann. Pure Appl. Log..

On the predictability of coupled automata: an allegory about chaos

John N. Tsitsiklis, Samuel R. Buss, Christos H. Papadimitriou, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Switching lemma for small restrictions and lower bounds for k-DNF resolution

Samuel R. Buss, Russell Impagliazzo, Nathan Segerlind, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

On transformations of constant depth propositional proofs

Samuel R. Buss, Arnold Beckmann, S. Buss, 2019, Ann. Pure Appl. Log..

Alternation Trading Proofs and Their Limitations

Samuel R. Buss, 2013, MFCS.

Sharpened lower bounds for cut elimination

Samuel R. Buss, 2012, J. Symb. Log..

Fragments of Approximate Counting

Samuel R. Buss, Leszek Aleksander Kolodziejczyk, Neil Thapen, 2014, J. Symb. Log..

On Herbrand's Theorem

Samuel R. Buss, S. Buss, 1994, LCC.

2-D Tucker is PPA complete

Samuel R. Buss, Maria Luisa Bonet, James Aisenberg, 2020, Electron. Colloquium Comput. Complex..

Corrected upper bounds for free-cut elimination

Samuel R. Buss, Arnold Beckmann, 2011, Theor. Comput. Sci..

Propositional proofs and reductions between NP search problems

Samuel R. Buss, Alan S. Johnson, 2012, Ann. Pure Appl. Log..

QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS

Samuel R. Buss, Maria Luisa Bonet, James Aisenberg, 2016, The Journal of Symbolic Logic.

Reordering Rule Makes OBDD Proof Systems Stronger

Samuel R. Buss, Alexander Knop, Dmitry Itsykson, 2018, Electron. Colloquium Comput. Complex..

Sub-computable Boundedness Randomness

Samuel R. Buss, Douglas A. Cenzer, Jeffrey B. Remmel, 2014, Log. Methods Comput. Sci..

Resolution and the Weak Pigeonhole Principle

Samuel R. Buss, Toniann Pitassi, T. Pitassi, 1997, CSL.

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

Samuel R. Buss, Jan Johannsen, Jan Hoffmann, 2008, Log. Methods Comput. Sci..

Some remarks on lengths of propositional proofs

Samuel R. Buss, S. Buss, 1995, Arch. Math. Log..

3-D Computer Graphics: Plate section

Samuel R. Buss, 2003 .

Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours

Samuel R. Buss, Peter N. Yianilos, P. Yianilos, 1994, SODA '94.

Expander Construction in VNC1

Samuel R. Buss, Valentine Kabanets, Michal Koucký, 2020, Electron. Colloquium Comput. Complex..

How Small Can the Set of Generics Be

Jörg Brendle, Samuel R. Buss, Petr Hájek, 2016 .

Relating the Bounded Arithmetic and Polynomial Time Hierarchies

Samuel R. Buss, 1995, Ann. Pure Appl. Log..

Lower Bounds on OBDD Proofs with Several Orders

Samuel R. Buss, Dmitry Sokolov, Alexander Knop, 2020, Electron. Colloquium Comput. Complex..

Resolution Proofs of Generalized Pigeonhole Principles

Samuel R. Buss, György Turán, S. Buss, 1988, Theor. Comput. Sci..

3-D Computer Graphics: Preface

Samuel R. Buss, 2003 .

Improved Separations of Regular Resolution from Clause Learning Proof Systems

Samuel R. Buss, Maria Luisa Bonet, Jan Johannsen, 2012, J. Artif. Intell. Res..

Probabilistic algorithmic randomness

Samuel R. Buss, Mia Minnes, 2013, J. Symb. Log..

The Modal Logic of Pure Provability

Samuel R. Buss, S. Buss, 1990, Notre Dame J. Formal Log..

University of California, Irvine Irvine, California March 27–30, 2008

Samuel R. Buss, Theodore A. Slaman, Stephen Cook, 2008 .

3-D Computer Graphics

Samuel R. Buss, 2003 .

Good degree bounds on Nullstellensatz refutations of the induction principle

Samuel R. Buss, Toniann Pitassi, T. Pitassi, 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

Injection Structures Specified by Finite State Transducers

Samuel R. Buss, Douglas A. Cenzer, Jeffrey B. Remmel, 2017, Computability and Complexity.

Short Proofs of the Kneser-Lovász Coloring Principle pdf

Samuel R. Buss, Maria Luisa Bonet, Gabriel Istrate, 2015, ICALP.

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

Samuel R. Buss, Jan Hoffmann, 2008, Theor. Comput. Sci..

The NP-Completeness of Reflected Fragments of Justification Logics

Samuel R. Buss, Roman Kuznets, S. Buss, 2009, LFCS.

On Linear Resolution

Samuel R. Buss, Jan Johannsen, 2016, J. Satisf. Boolean Model. Comput..

DRAT Proofs, Propagation Redundancy, and Extended Resolution

Samuel R. Buss, Neil Thapen, S. Buss, 2019, SAT.

Minimum propositional proof length is NP-hard to linearly approximate

Michael Alekhnovich, Samuel R. Buss, Toniann Pitassi, 1998, Journal of Symbolic Logic.

The deduction rule and linear and near-linear proof simulations

Samuel R. Buss, Maria Luisa Bonet, S. Buss, 1993, Journal of Symbolic Logic.

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

Samuel R. Buss, Alan S. Johnson, 2010, Math. Log. Q..

Chapter II - First-Order Proof Theory of Arithmetic

Samuel R. Buss, S. Buss, 1998 .

The Serial Transitive Closure Problem for Trees

Samuel R. Buss, Maria Luisa Bonet, 1995, SIAM J. Comput..

Solving the Minimum-Cost Matching Problem for Quasi-Convex Tours: An Efficient ANSI C Implementation

Samuel R. Buss, 1994 .

3D Computer Graphics

Samuel R. Buss, 2003 .

Unshuffling a square is NP-hard pdf

Samuel R. Buss, Michael Soltys, 2014, J. Comput. Syst. Sci..

3-D computer graphics : a mathematical introduction with OpenGL / Samuel R. Buss.

Samuel R. Buss, 2003 .

Preface

Samuel R. Buss, Andrea Sorbi, S. Barry Cooper, 2009, Ann. Pure Appl. Log..

Intuitionistic Validity in T-Normal Kripke Structures

Samuel R. Buss, S. Buss, 1993, Ann. Pure Appl. Log..

Size-Depth Tradeoffs for Boolean Fomulae

Samuel R. Buss, Maria Luisa Bonet, 1994, Inf. Process. Lett..

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

Samuel R. Buss, Maria Luisa Bonet, S. Buss, 2012, SAT.

Ordinal notations and well-orderings in bounded arithmetic

Samuel R. Buss, Chris Pollett, Arnold Beckmann, 2003, Ann. Pure Appl. Log..

Collision detection with relative screw motion

Samuel R. Buss, S. Buss, 2005, The Visual Computer.

Pool resolution is NP-hard to recognize

Samuel R. Buss, 2009, Arch. Math. Log..

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

Samuel R. Buss, Arnold Beckmann, 2009, J. Math. Log..

The Application Of A Pattern Matching Algorithm to Searching Medical Record Text

Samuel R. Buss, P. N. Yianilos, R. A. Harbort, 1978 .

Selectively Damped Least Squares for Inverse Kinematics

Samuel R. Buss, Jin-Su Kim, S. Buss, 2005, J. Graph. Tools.

Resource-bounded continuity and sequentiality for type-two functionals

Bruce M. Kapron, Samuel R. Buss, 2002, TOCL.

Propositional Consistency Proofs

Samuel R. Buss, S. Buss, 1991, Ann. Pure Appl. Log..

Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle

Samuel R. Buss, Toniann Pitassi, 1998, J. Comput. Syst. Sci..

Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes

Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, 2001, J. Comput. Syst. Sci..

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

Samuel R. Buss, Ryan Williams, 2012, Computational Complexity Conference.

The polynomial hierarchy and fragments of bounded arithmetic

Samuel R. Buss, S. Buss, 1985, STOC '85.

Resource-bounded continuity and sequentiality for type-two functionals

Bruce M. Kapron, Samuel R. Buss, 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

Linear gaps between degrees for the polynomial calculus modulo distinct primes

Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, 1999, STOC '99.

Computability in Europe 2009

Samuel R. Buss, Benedikt Löwe, Klaus Ambos-Spies, 2012, Ann. Pure Appl. Log..

Separation results for the size of constant-depth propositional proofs

Samuel R. Buss, Arnold Beckmann, S. Buss, 2005, Ann. Pure Appl. Log..

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

Samuel R. Buss, Ramyaa, 2018, Math. Log. Q..

3D Computer Graphics: A Mathematical Introduction with OpenGL

Samuel R. Buss, S. Buss, 2003 .

The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic

Samuel R. Buss, Grigori Mints, S. Buss, 1999, Ann. Pure Appl. Log..

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

Samuel R. Buss, Russell Impagliazzo, Nathan Segerlind, 2004, SIAM J. Comput..

Unprovability of Consistency Statements in Fragments of Bounded Arithmetic

Samuel R. Buss, Aleksandar Ignjatovic, S. Buss, 1995, Ann. Pure Appl. Log..

An Optimal Parallel Algorithm for Formula Evaluation

Samuel R. Buss, V. Ramachandran, Stephen A. Cook, 1992, SIAM J. Comput..

3-D Computer Graphics: Bibliography

Samuel R. Buss, 2003 .

The Graph of Multiplication is Equivalent to Counting

Samuel R. Buss, S. Buss, 1992, Inf. Process. Lett..

Collision Detection with Glide Rotations

Samuel R. Buss, S. Buss, 2003 .

Small Stone in Pool

Samuel R. Buss, Leszek Aleksander Kolodziejczyk, S. Buss, 2014, Log. Methods Comput. Sci..

Strong isomorphism reductions in complexity theory

Yijia Chen, Jörg Flum, Samuel R. Buss, 2011, The Journal of Symbolic Logic.

Incompleteness of Behavioral Logics

Samuel R. Buss, Grigore Rosu, 2000, CMCS.

Annals of Pure and Applied Logic

Samuel R. Buss, S. Buss, 2022 .

Polynomial size proofs of the propositional pigeonhole principle

Samuel R. Buss, S. Buss, Samuel R. Buss, 1987, Journal of Symbolic Logic.

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

Samuel R. Buss, Daniel J. Tracy, Bryan M. Woods, 2009, 2009 IEEE Virtual Reality Conference.

The boolean formula value problem

Samuel R. Buss, 1987 .

Qualitative and Probabilistic Models of Full Belief

Samuel R. Buss, Petr Hájek, Pavel Pudlák, 2016 .

Cutting planes, connectivity, and threshold logic

Peter Clote, Samuel R. Buss, P. Clote, 1996, Arch. Math. Log..

Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

Jan Krajícek, Alexander A. Razborov, Samuel R. Buss, 1997, computational complexity.

The Prospects for Mathematical Logic in the Twenty-First Century

Samuel R. Buss, Richard A. Shore, Anand Pillay, 2001, Bulletin of Symbolic Logic.

Uniform proofs of ACC representations

Samuel R. Buss, S. Buss, 2017, Archive for Mathematical Logic.

MaxSAT Resolution With the Dual Rail Encoding

Joao Marques-Silva, Samuel R. Buss, Maria Luisa Bonet, 2018, AAAI.

Expander construction in VNC1

Samuel R. Buss, Valentine Kabanets, Michal Koucký, 2020, Ann. Pure Appl. Log..

Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies

Samuel R. Buss, S. Buss, 2006, Theor. Comput. Sci..

Limits on Alternation Trading Proofs for Time–Space Lower Bounds

Samuel R. Buss, Ryan Williams, S. Buss, 2012, computational complexity.

The Boolean formula value problem is in ALOGTIME

Samuel R. Buss, S. Buss, 1987, STOC.

Lower complexity bounds in justification logic

Samuel R. Buss, Roman Kuznets, S. Buss, 2012, Ann. Pure Appl. Log..

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

Samuel R. Buss, Arnold Beckmann, 2014, ACM Trans. Comput. Log..

Feasible set functions have small circuits

Samuel R. Buss, Neil Thapen, Sy-David Friedman, 2019, Comput..

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

Samuel R. Buss, 2015, Stud Logica.

On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics

Samuel R. Buss, S. Buss, 1994, Journal of Symbolic Logic.

The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic

Samuel R. Buss, S. Buss, 1986, SCT.

On Truth-Table Reducibility to SAT

Samuel R. Buss, Louise Hay, S. Buss, 1991, Inf. Comput..

Strategies for Stable Merge Sorting

Samuel R. Buss, Alexander Knop, 2019, SODA.

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

Samuel R. Buss, Pavel Pudlák, S. Buss, 1994, CSL.

Chapter I - An Introduction to Proof Theory

Samuel R. Buss, S. Buss, 1998 .

Safe Recursive Set Functions

Samuel R. Buss, Sy-David Friedman, Arnold Beckmann, 2015, J. Symb. Log..

DRMaxSAT with MaxHS: First Contact

Joao Marques-Silva, Samuel R. Buss, Maria Luisa Bonet, 2019, SAT.

Computability in Europe 2011

Samuel R. Buss, Dag Normann, Benedikt Löwe, 2013, Ann. Pure Appl. Log..

Spherical averages and applications to spherical splines and interpolation

Samuel R. Buss, Jay P. Fillmore, S. Buss, 2001, TOGS.

Propositional Proofs in Frege and Extended Frege Systems (Abstract)

Samuel R. Buss, S. Buss, 2015, CSR.

Cobham recursive set functions

Samuel R. Buss, Neil Thapen, Sy-David Friedman, 2016, Ann. Pure Appl. Log..

Lower bounds on Nullstellensatz proofs via designs

Samuel R. Buss, 1996, Proof Complexity and Feasible Arithmetics.

Mathematical Fuzzy Logic – State of Art

Samuel R. Buss, Petr Hájek, Pavel Pudlák, 2016 .

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

Samuel R. Buss, Chris Pollett, Arnold Beckmann, 2003, Ann. Pure Appl. Log..

Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization

Samuel R. Buss, 1997, Kurt Gödel Colloquium.

The Undecidability of k-Provability

Samuel R. Buss, S. Buss, 1991, Ann. Pure Appl. Log..

Polynomial Size Proofs of the Propositional Pigeonhole Principle

Samuel R. Buss, 1987, J. Symb. Log..

The NP Search Problems of Frege and Extended Frege Proofs

Samuel R. Buss, Arnold Beckmann, 2017, ACM Trans. Comput. Log..

On the deduction rule and the number of proof lines

Samuel R. Buss, Maria Luisa Bonet, 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

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

Samuel R. Buss, Louise Hay, S. Buss, 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

New separations in propositional proof complexity

Samuel R. Buss, Russell Impagliazzo, Nathan Segerlind, 2003 .

Are there Hard Examples for Frege Systems

Samuel R. Buss, Toniann Pitassi, Maria Luisa Bonet, 1995 .

The Superjump in Martin-Löf Type Theory

Samuel R. Buss, Michael Rathjen, S. Buss, 2002 .

Proof Complexity and Feasible Arithmetics

Samuel R. Buss, Paul Beame, P. Beame, 1997 .

A conservation result concerning bounded theories and the collection axiom

Samuel R. Buss, 1987 .

A Bipartite Matching Approach to Approximate String Comparison and Search

Samuel R. Buss, Peter N. Yianilos, P. Yianilos, 1995 .

Chip-Firing Games with Dirichlet Eigenvalues and Discrete Green's Functions

Samuel R. Buss, Robert B. Ellis, Ronald L. Graham, 2002 .

A note on bootstrapping intuitionistic bounded arithmetic

Samuel R. Buss, 1993 .

Solving the Fisher-Wright and coalescence problems with a discrete Markov chain analysis

Peter Clote, Samuel R. Buss, P. Clote, 2004, Advances in Applied Probability.

Provably Total Functions in Bounded Arithmetic Theories Ri 3 , U i 2 and V i 2

Samuel R. Buss, Gaisi Takeuti, 2002 .

Propositional Proof Complexity An Introduction

Samuel R. Buss, S. Buss, 1999 .

The witness function method and provably recursive functions of peano arithmetic

Samuel R. Buss, S. Buss, 1995 .

Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989

Samuel R. Buss, Phillip J. Scott, 1990 .

“Just Because”: Taking Belief Bases Seriously

Samuel R. Buss, Petr Hájek, Pavel Pudlák, 2016 .

The depth of intuitionistic cut free proofs

Samuel R. Buss, S. Buss, Rosalie Iemho, 2003 .

Bounded Arithmetic and Propositional Proof Complexity

Samuel R. Buss, S. Buss, 1997 .

Bounded Arithmetic, Cryptography and Complexity

Samuel R. Buss, 2008 .

Classification of Subsheaves over GL-Algebras

Samuel R. Buss, Petr Hájek, Pavel Pudlák, 2016 .

Algorithms for Boolean Formula Evaluation and for Tree Contraction

Samuel R. Buss, 2007 .

Arithmetic theories with prenex normal form induction

Samuel R. Buss, Chris Pollett, 1997 .

Continuous Images of Coanalytic Sets

Greg Hjorth, Samuel R. Buss, Petr Hájek, 2016 .

Cut Elimination In Situ

Samuel R. Buss, 2015 .