| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Samuel R. Buss |
Sharpened lower bounds for cut elimination.  |
J. Symb. Log.  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss |
Towards NP-P via proof complexity and search. |
Ann. Pure Appl. Logic |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe |
Computability in Europe 2009. |
Ann. Pure Appl. Logic |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Roman Kuznets |
Lower complexity bounds in justification logic. |
Ann. Pure Appl. Logic |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Samuel R. Buss |
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Arnold Beckmann, Samuel R. Buss |
Corrected upper bounds for free-cut elimination. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Alan S. Johnson |
The quantifier complexity of polynomial-size iterated definitions in first-order logic. |
Math. Log. Q. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi |
Preface. |
Ann. Pure Appl. Logic |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
Pool resolution is NP-hard to recognize. |
Arch. Math. Log. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Roman Kuznets |
The NP-Completeness of Reflected Fragments of Justification Logics. |
LFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Tracy, Samuel R. Buss, Bryan M. Woods |
Efficient Large-Scale Sweep and Prune Methods with AABB Insertion and Removal. |
VR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Jan Hoffmann 0002 |
The NP-hardness of finding a directed acyclic graph for regular resolution. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen |
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning. |
Logical Methods in Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen |
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss |
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
Collision detection with relative screw motion. |
The Visual Computer |
2005 |
DBLP DOI BibTeX RDF |
proper collision, rigid body collision, screw motion, collision detection, rasterization |
| 1 | Arnold Beckmann, Samuel R. Buss |
Separation results for the size of constant-depth propositional proofs. |
Ann. Pure Appl. Logic |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Jin-Su Kim |
Selectively Damped Least Squares for Inverse Kinematics. |
J. Graphics Tools |
2005 |
DBLP BibTeX RDF |
|
| 1 | Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo |
A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Beckmann, Chris Pollett, Samuel R. Buss |
Ordinal notations and well-orderings in bounded arithmetic. |
Ann. Pure Appl. Logic |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Beckmann, Samuel R. Buss, Chris Pollett |
Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223]. |
Ann. Pure Appl. Logic |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore |
The prospects for mathematical logic in the twenty-first century |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss, Bruce M. Kapron |
Resource-bounded continuity and sequentiality for type-two functionals. |
ACM Trans. Comput. Log. |
2002 |
DBLP DOI BibTeX RDF |
Higher-order complexity, decision trees, sequential computation |
| 1 | Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo |
A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Jay P. Fillmore |
Spherical averages and applications to spherical splines and interpolation. |
ACM Trans. Graph. |
2001 |
DBLP DOI BibTeX RDF |
Bézier curve, least squares minimization, quaternion interpolation, spherical average, spherical interpolation, spherical mean, B-spline, quaternions, barycentric coordinates, spline interpolation, spline curve |
| 1 | Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi |
Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. |
J. Symb. Log. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore |
The prospects for mathematical logic in the twenty-first century. |
Bulletin of Symbolic Logic |
2001 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss, Pavel Pudlák |
On the computational content of intuitionistic propositional proofs. |
Ann. Pure Appl. Logic |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi |
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Grigore Rosu |
Incompleteness of Behavioral Logics. |
Electr. Notes Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Bruce M. Kapron |
Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
type-two functionals, higher-type complexity, continuity, sequentiality |
| 1 | Samuel R. Buss |
Bounded Arithmetic, Proof Complexity and Two Papers of Parikh. |
Ann. Pure Appl. Logic |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Grigori Mints |
The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic. |
Ann. Pure Appl. Logic |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi |
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract). (PDF / PS) |
IEEE Conference on Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
counting principles, graph tautologies, algebraic proof systems, binomial proofs, Nullstellensatz proofs, polynomial calculus proofs, propositional logic, Proof complexity |
| 1 | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi |
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Toniann Pitassi |
Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Peter N. Yianilos |
Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi |
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jiri Sgall |
Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting. |
Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization. |
Kurt Gödel Colloquium |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Toniann Pitassi |
Resolution and the Weak Pigeonhole Principle. |
CSL |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Toniann Pitassi |
Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
Relating the Bounded Arithmetic and Polynomial Time Hierarchies. |
Ann. Pure Appl. Logic |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Aleksandar Ignjatovic |
Unprovability of Consistency Statements in Fragments of Bounded Arithmetic. |
Ann. Pure Appl. Logic |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Samuel R. Buss |
The Serial Transitive Closure Problem for Trees. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Samuel R. Buss |
Size-Depth Tradeoffs for Boolean Fomulae. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
On Gödel's Theorems on Lenghts of Proofs I: Number of Lines and Speedup for Arithmetics. |
J. Symb. Log. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss |
On Herbrand's Theorem. |
LCC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Peter N. Yianilos |
Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
bipartite weighted matching, concave penalty function, quadrangle inequality, string comparison, computational geometry, convexity, assignment problem, linear time, Monge property |
| 1 | Pavel Pudlák, Samuel R. Buss |
How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus. |
CSL |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Samuel R. Buss |
The Deduction Rule and Linear and Near-Linear Proof Simulations. |
J. Symb. Log. |
1993 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss |
Intuitionistic Validity in T-Normal Kripke Structures. |
Ann. Pure Appl. Logic |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
The Graph of Multiplication is Equivalent to Counting. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, S. Cook, A. Gupta, V. Ramachandran |
An Optimal Parallel Algorithm for Formula Evaluation. |
SIAM J. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Louise Hay |
On Truth-Table Reducibility to SAT |
Inf. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
Propositional Consistency Proofs. |
Ann. Pure Appl. Logic |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
The Undecidability of k-Provability. |
Ann. Pure Appl. Logic |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Samuel R. Buss |
On the Deduction Rule and the Number of Proof Lines |
LICS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
The Modal Logic of Pure Provability. |
Notre Dame Journal of Formal Logic |
1990 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis |
On the Predictability of Coupled Automata: An Allegory about Chaos |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
coupled automata, symmetric global control, undecidable problem, complexity, predictability, chaos, dichotomy |
| 1 | Samuel R. Buss, György Turán |
Resolution Proofs of Generalized Pigeonhole Principles. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
Polynomial Size Proofs of the Propositional Pigeonhole Principle. |
J. Symb. Log. |
1987 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss |
The Boolean Formula Value Problem Is in ALOGTIME |
STOC |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic. |
Structure in Complexity Theory Conference |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss |
The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract) |
STOC |
1985 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")