Bounded arithmetic. Zbl 0649.03042
Buss, Samuel R. |
|
1986
|
Handbook of proof theory. Zbl 0898.03001
|
|
1998
|
An introduction to proof theory. Zbl 0912.03024
Buss, Samuel R. |
|
1998
|
Polynomial size proofs of the propositional pigeonhole principle. Zbl 0636.03053
Buss, Samuel R. |
|
1987
|
The polynomial hierarchy and intuitionistic bounded arithmetic. Zbl 0654.03043
Buss, S. R. |
|
1986
|
On truth-table reducibility to SAT. Zbl 0800.68443
Buss, Samuel R.; Hay, Louise |
|
1991
|
Linear gaps between degrees for the polynomial calculus modulo distinct primes. Zbl 1007.03052
Buss, Sam; Grigoriev, Dima; Impagliazzo, Russell; Pitassi, Toniann |
|
2001
|
First-order proof theory of arithmetic. Zbl 0911.03029
Buss, Samuel R. |
|
1998
|
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting. Zbl 0890.03030
Buss, S.; Impagliazzo, R.; Krajíček, J.; Pudlák, P.; Razborov, A. A.; Sgall, J. |
|
1997
|
A switching lemma for small restrictions and lower bounds for \(k\)-DNF resolution. Zbl 1059.03063
Segerlind, Nathan; Buss, Sam; Impagliazzo, Russell |
|
2004
|
An optimal parallel algorithm for formula evaluation. Zbl 0825.68424
Buss, S.; Cook, S.; Gupta, Arvind; Ramachandran, V. |
|
1992
|
The undecidability of \(k\)-provability. Zbl 0749.03039
Buss, Samuel R. |
|
1991
|
Propositional proofs and reductions between NP search problems. Zbl 1252.03127
Buss, Samuel R.; Johnson, Alan S. |
|
2012
|
An application of Boolean complexity to separation problems in bounded arithmetic. Zbl 0799.03066
Buss, Samuel R.; Krajíček, Jan |
|
1994
|
Towards NP-P via proof complexity and search. Zbl 1257.03086
Buss, Samuel R. |
|
2012
|
Resolution proofs of generalized pigeonhole principles. Zbl 0709.03006
Buss, Samuel R.; Turán, György |
|
1988
|
Diffusion, quantum theory, and radically elementary mathematics. Zbl 1104.81003
|
|
2006
|
Unshuffling a square is NP-hard. Zbl 1285.68130
Buss, Sam; Soltys, Michael |
|
2014
|
Are there hard examples for Frege systems? Zbl 0834.03021
Bonet, Maria Luisa; Buss, Samuel R.; Pitassi, Toniann |
|
1995
|
Relating the bounded arithmetic and polynomial time hierarchies. Zbl 0829.03035
Buss, Samuel R. |
|
1995
|
Resolution and the weak pigeonhole principle. Zbl 0910.03036
Buss, Sam; Pitassi, Toniann |
|
1998
|
Size-depth tradeoffs for Boolean formulae. Zbl 0802.68067
Bonet, Maria Luisa; Buss, Samuel R. |
|
1994
|
Resolution trees with lemmas: resolution refinements that characterize DLL algorithms with clause learning. Zbl 1159.03009
Buss, Samuel R.; Hoffmann, Jan; Johannsen, Jan |
|
2008
|
Minimum propositional proof length is NP-hard to linearly approximate. Zbl 0977.03032
Alekhnovich, Michael; Buss, Sam; Moran, Shlomo; Pitassi, Toniann |
|
2001
|
Alogtime algorithms for tree isomorphism, comparison, and canonization. Zbl 0884.68098
Buss, Samuel R. |
|
1997
|
Axiomatizations and conservation results for fragments of bounded arithmetic. Zbl 0699.03032
Buss, Samuel R. |
|
1990
|
On Herbrand’s theorem. Zbl 1540.03102
Buss, Samuel R. |
|
1995
|
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs. Zbl 1353.03071
Buss, Samuel R.; Kołodziejczyk, Leszek Aleksander; Zdanowski, Konrad |
|
2015
|
Fragments of approximate counting. Zbl 1338.03107
Buss, Samuel R.; Kołodziejczyk, Leszek Aleksander; Thapen, Neil |
|
2014
|
Algorithms for Boolean formula evaluation and for tree contraction. Zbl 0792.68046
Buss, Samuel R. |
|
1993
|
Improved witnessing and local improvement principles for second-order bounded arithmetic. Zbl 1287.03105
Beckmann, Arnold; Buss, Samuel R. |
|
2014
|
2-D Tucker is PPA complete. Zbl 1436.68127
Aisenberg, James; Bonet, Maria Luisa; Buss, Sam |
|
2020
|
Propositional consistency proofs. Zbl 0749.03040
Buss, Samuel R. |
|
1991
|
Propositional proof complexity: an introduction. Zbl 0946.68128
Buss, Samuel R. |
|
1999
|
Minimum propositional proof length is NP-hard to linearly approximate (extended abstract). Zbl 0911.03028
Alekhnovich, Michael; Buss, Sam; Moran, Shlomo; Pitassi, Toniann |
|
1998
|
Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic. Zbl 1204.03056
Beckmann, Arnold; Buss, Samuel R. |
|
2009
|
On Gödel’s theorems on lengths of proofs. I: Number of lines and speedup for arithmetics. Zbl 0805.03047
Buss, Samuel R. |
|
1994
|
The complexity of the disjunction and existential properties in intuitionistic logic. Zbl 0939.03064
Buss, Sam; Mints, Grigori |
|
1999
|
How to lie without being (easily) convicted and the lengths of proofs in propositional calculus. Zbl 1044.03542
Pudlák, Pavel; Buss, Samuel R. |
|
1995
|
Cutting planes, connectivity, and threshold logic. Zbl 0841.03029
Buss, Samuel R.; Clote, Peter |
|
1996
|
Unprovability of consistency statements in fragments of bounded arithmetic. Zbl 0834.03022
Buss, Samuel R.; Ignjatović, Aleksandar |
|
1995
|
Bounded arithmetic and propositional proof complexity. Zbl 0882.68130
Buss, Samuel R. |
|
1997
|
Intuitionistic validity in \(T\)-normal Kripke structures. Zbl 0802.03006
Buss, Samuel R. |
|
1993
|
The deduction rule and linear and near-linear proof simulations. Zbl 0848.03028
Bonet, Maria Luisa; Buss, Samuel R. |
|
1993
|
The witness function method and provably recursive functions of Peano arithmetic. Zbl 0829.03036
Buss, Samuel R. |
|
1994
|
Lower bounds on Nullstellensatz proofs via designs. Zbl 0890.03029
Buss, Samuel R. |
|
1998
|
Accurate and efficient simulation of rigid-body rotations. Zbl 1035.70500
Buss, Samuel R. |
|
2000
|
On the computational content of intuitionistic propositional proofs. Zbl 1009.03027
Buss, Samuel R.; Pudlák, Pavel |
|
2001
|
Good degree bounds on Nullstellensatz refutations of the induction principle. Zbl 0921.68088
Buss, Samuel R.; Pitassi, Toniann |
|
1998
|
A conservation result concerning bounded theories and the collection axiom. Zbl 0626.03048
Buss, Samuel R. |
|
1987
|
Characterising definable search problems in bounded arithmetic via proof notations. Zbl 1244.03163
Beckmann, Arnold; Buss, Samuel R. |
|
2010
|
Separation results for the size of constant-depth propositional proofs. Zbl 1089.03048
Beckmann, Arnold; Buss, Samuel R. |
|
2005
|
Some remarks on lengths of propositional proofs. Zbl 0841.03030
Buss, Samuel R. |
|
1995
|
Provably total function in bounded arithmetic theories \(R_ 3^ i\), \(U_ 2^ i\) and \(V_ 2^ i\). Zbl 0799.03065
Buss, Samuel R.; Krajíček, Jan; Takeuti, Gaisi |
|
1993
|
Cut elimination in situ. Zbl 1380.03062
Buss, Sam |
|
2015
|
Improved separations of regular resolution from clause learning proof systems. Zbl 1361.68185
Bonet, Maria Luisa; Buss, Sam; Johannsen, Jan |
|
2014
|
Strong isomorphism reductions in complexity theory. Zbl 1248.03060
Buss, Sam; Chen, Yijia; Flum, Jörg; Friedman, Sy-David; Müller, Moritz |
|
2011
|
DRAT proofs, propagation redundancy, and extended resolution. Zbl 1441.03043
Buss, Sam; Thapen, Neil |
|
2019
|
Incompleteness of behavioral logics. Zbl 0959.03506
Buss, Samuel; Roşu, Grigore |
|
2000
|
On the predictability of coupled automata: An allegory about chaos. Zbl 0760.68031
Buss, Samuel R.; Papadimitriou, Christos H.; Tsitsiklis, John N. |
|
1991
|
On model theory for intuitionistic bounded arithmetic with applications to independence results. Zbl 0764.03021
Buss, Samuel R. |
|
1990
|
Linear gaps between degrees for the polynomial calculus modulo distinct primes. Zbl 1345.03105
Buss, Sam; Grigoriev, Dima; Impagliazzo, Russell; Pitassi, Toniann |
|
1999
|
Quasipolynomial size proofs of the propositional pigeonhole principle. Zbl 1347.03100
Buss, Sam |
|
2015
|
Small Stone in pool. Zbl 1336.03019
Buss, Samuel R.; Kolodziejczyk, Leszek Alek |
|
2014
|
Safe recursive set functions. Zbl 1357.03075
Beckmann, Arnold; Buss, Samuel R.; Friedman, Sy-David |
|
2015
|
An improved separation of regular resolution from pool resolution and clause learning. Zbl 1273.03048
Bonet, Maria Luisa; Buss, Sam |
|
2012
|
Linear and time minimum-cost matching algorithms for quasi-convex tours. Zbl 0913.05086
Buss, Samuel R.; Yianilos, Peter N. |
|
1998
|
A note on bootstrapping intuitionistic bounded arithmetic. Zbl 0792.03039
Buss, Samuel R. |
|
1992
|
The prospects for mathematical logic in the twenty-first century. Zbl 0981.03003
Buss, Samuel R.; Kechris, Alexander S.; Pillay, Anand; Shore, Richard A. |
|
2001
|
Corrected upper bounds for free-cut elimination. Zbl 1267.03053
Beckmann, Arnold; Buss, Samuel R. |
|
2011
|
Reordering rule makes OBDD proof systems stronger. Zbl 1441.03042
Buss, Sam; Itsykson, Dmitry; Knop, Alexander; Sokolov, Dmitry |
|
2018
|
DRMaxSAT with MaxHS: first contact. Zbl 1441.68232
Morgado, Antonio; Ignatiev, Alexey; Bonet, Maria Luisa; Marques-Silva, Joao; Buss, Sam |
|
2019
|
Quasipolynomial size Frege proofs of Frankl’s theorem on the trace of sets. Zbl 1436.03298
Aisenberg, James; Bonet, Maria Luisa; Buss, Sam |
|
2016
|
Linear and \(O(n \text{log} n)\) time minimum-cost matching algorithms for quasi-convex tours. Zbl 0867.05071
Buss, Samuel R.; Yianilos, Peter N. |
|
1994
|
The modal logic of pure provability. Zbl 0713.03009
Buss, Samuel R. |
|
1990
|
Cobham recursive set functions. Zbl 1383.03050
Beckmann, Arnold; Buss, Sam; Friedman, Sy-David; Müller, Moritz; Thapen, Neil |
|
2016
|
Limits on alternation trading proofs for time-space lower bounds. Zbl 1338.68080
Buss, Samuel R.; Williams, Ryan |
|
2015
|
The NP-completeness of reflected fragments of justification logics. Zbl 1211.03035
Buss, Samuel R.; Kuznets, Roman |
|
2009
|
Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies. Zbl 1094.03044
Buss, Samuel R. |
|
2006
|
Bounded arithmetic, proof complexity and two papers of Parikh. Zbl 0924.03106
Buss, Samuel R. |
|
1999
|
The graph of multiplication is equivalent to counting. Zbl 0748.68018
Buss, Samuel R. |
|
1992
|
Ordinal notations and well-orderings in bounded arithmetic. Zbl 1015.03055
Beckmann, Arnold; Pollett, Chris; Buss, Samuel R. |
|
2003
|
The NP search problems of Frege and extended Frege proofs. Zbl 1407.03071
Beckmann, Arnold; Buss, Sam |
|
2017
|
Resource-bounded continuity and sequentiality for type-two functionals. Zbl 1365.03029
Buss, Samuel R.; Kapron, Bruce M. |
|
2002
|
Short proofs of the Kneser-Lovász coloring principle. Zbl 1443.03040
Aisenberg, James; Bonet, Maria Luisa; Buss, Sam; Crăciun, Adrian; Istrate, Gabriel |
|
2018
|
Strategies for stable merge sorting. Zbl 1431.68021
Buss, Sam; Knop, Alexander |
|
2019
|
Injection structures specified by finite state transducers. Zbl 1485.03108
Buss, Sam; Cenzer, Douglas; Minnes, Mia; Remmel, Jeffrey B. |
|
2017
|
Sub-computable boundedness randomness. Zbl 1325.03050
Buss, Sam; Cenzer, Douglas; Remmel, Jeffrey B. |
|
2014
|
Short proofs of the Kneser-Lovász coloring principle. Zbl 1443.03041
Aisenberg, James; Bonet, Maria Luisa; Buss, Sam; Crãciun, Adrian; Istrate, Gabriel |
|
2015
|
3-D computer graphics. A mathematical introduction with OpenGL. Zbl 1044.65017
Buss, Samuel R. |
|
2003
|
Bounded arithmetic and constant depth Frege proofs. Zbl 1079.03050
Buss, Samuel R. |
|
2004
|
Lower complexity bounds in justification logic. Zbl 1243.03026
Buss, Samuel R.; Kuznets, Roman |
|
2012
|
Expander construction in \(\mathrm{VNC}^1\). Zbl 1481.03065
Buss, Sam; Kabanets, Valentine; Kolokolova, Antonina; Koucký, Michal |
|
2020
|
The NP-hardness of finding a directed acyclic graph for regular resolution. Zbl 1145.03034
Buss, Samuel R.; Hoffmann, Jan |
|
2008
|
The serial transitive closure problem for trees. Zbl 0828.68099
Bonet, Maria Luisa; Buss, Samuel R. |
|
1995
|
On Gödel’s theorems on lengths of proofs. II: Lower bounds for recognizing \(k\) symbol provability. Zbl 0829.03034
Buss, Samuel R. |
|
1995
|
DRAT and propagation redundancy proofs without new variables. Zbl 1535.03275
Buss, Sam; Thapen, Neil |
|
2021
|
On the consistency of circuit lower bounds for non-deterministic time. Zbl 07844669
Atserias, Albert; Buss, Sam; Müller, Moritz |
|
2023
|
On linear resolution. Zbl 1484.03120
Buss, Sam; Johannsen, Jan |
|
2017
|
Expander construction in \(\mathsf{VNC}^1\). Zbl 1402.03081
Buss, Sam; Kabanets, Valentine; Kolokolova, Antonina; Koucký, Michal |
|
2017
|
On the consistency of circuit lower bounds for non-deterministic time. Zbl 07844669
Atserias, Albert; Buss, Sam; Müller, Moritz |
|
2023
|
DRAT and propagation redundancy proofs without new variables. Zbl 1535.03275
Buss, Sam; Thapen, Neil |
|
2021
|
2-D Tucker is PPA complete. Zbl 1436.68127
Aisenberg, James; Bonet, Maria Luisa; Buss, Sam |
|
2020
|
Expander construction in \(\mathrm{VNC}^1\). Zbl 1481.03065
Buss, Sam; Kabanets, Valentine; Kolokolova, Antonina; Koucký, Michal |
|
2020
|
Proof complexity of systems of (non-deterministic) decision trees and branching programs. Zbl 07650825
Buss, Sam; Das, Anupam; Knop, Alexander |
|
2020
|
DRAT proofs, propagation redundancy, and extended resolution. Zbl 1441.03043
Buss, Sam; Thapen, Neil |
|
2019
|
DRMaxSAT with MaxHS: first contact. Zbl 1441.68232
Morgado, Antonio; Ignatiev, Alexey; Bonet, Maria Luisa; Marques-Silva, Joao; Buss, Sam |
|
2019
|
Strategies for stable merge sorting. Zbl 1431.68021
Buss, Sam; Knop, Alexander |
|
2019
|
Reordering rule makes OBDD proof systems stronger. Zbl 1441.03042
Buss, Sam; Itsykson, Dmitry; Knop, Alexander; Sokolov, Dmitry |
|
2018
|
Short proofs of the Kneser-Lovász coloring principle. Zbl 1443.03040
Aisenberg, James; Bonet, Maria Luisa; Buss, Sam; Crăciun, Adrian; Istrate, Gabriel |
|
2018
|
Cobham recursive set functions and weak set theories. Zbl 1448.03029
Beckmann, Arnold; Buss, Sam; Friedman, Sy-David; Müller, Moritz; Thapen, Neil |
|
2018
|
The NP search problems of Frege and extended Frege proofs. Zbl 1407.03071
Beckmann, Arnold; Buss, Sam |
|
2017
|
Injection structures specified by finite state transducers. Zbl 1485.03108
Buss, Sam; Cenzer, Douglas; Minnes, Mia; Remmel, Jeffrey B. |
|
2017
|
On linear resolution. Zbl 1484.03120
Buss, Sam; Johannsen, Jan |
|
2017
|
Expander construction in \(\mathsf{VNC}^1\). Zbl 1402.03081
Buss, Sam; Kabanets, Valentine; Kolokolova, Antonina; Koucký, Michal |
|
2017
|
Uniform proofs of ACC representations. Zbl 1406.03053
Buss, Sam |
|
2017
|
Quasipolynomial size Frege proofs of Frankl’s theorem on the trace of sets. Zbl 1436.03298
Aisenberg, James; Bonet, Maria Luisa; Buss, Sam |
|
2016
|
Cobham recursive set functions. Zbl 1383.03050
Beckmann, Arnold; Buss, Sam; Friedman, Sy-David; Müller, Moritz; Thapen, Neil |
|
2016
|
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs. Zbl 1353.03071
Buss, Samuel R.; Kołodziejczyk, Leszek Aleksander; Zdanowski, Konrad |
|
2015
|
Cut elimination in situ. Zbl 1380.03062
Buss, Sam |
|
2015
|
Quasipolynomial size proofs of the propositional pigeonhole principle. Zbl 1347.03100
Buss, Sam |
|
2015
|
Safe recursive set functions. Zbl 1357.03075
Beckmann, Arnold; Buss, Samuel R.; Friedman, Sy-David |
|
2015
|
Limits on alternation trading proofs for time-space lower bounds. Zbl 1338.68080
Buss, Samuel R.; Williams, Ryan |
|
2015
|
Short proofs of the Kneser-Lovász coloring principle. Zbl 1443.03041
Aisenberg, James; Bonet, Maria Luisa; Buss, Sam; Crãciun, Adrian; Istrate, Gabriel |
|
2015
|
Unshuffling a square is NP-hard. Zbl 1285.68130
Buss, Sam; Soltys, Michael |
|
2014
|
Fragments of approximate counting. Zbl 1338.03107
Buss, Samuel R.; Kołodziejczyk, Leszek Aleksander; Thapen, Neil |
|
2014
|
Improved witnessing and local improvement principles for second-order bounded arithmetic. Zbl 1287.03105
Beckmann, Arnold; Buss, Samuel R. |
|
2014
|
Improved separations of regular resolution from clause learning proof systems. Zbl 1361.68185
Bonet, Maria Luisa; Buss, Sam; Johannsen, Jan |
|
2014
|
Small Stone in pool. Zbl 1336.03019
Buss, Samuel R.; Kolodziejczyk, Leszek Alek |
|
2014
|
Sub-computable boundedness randomness. Zbl 1325.03050
Buss, Sam; Cenzer, Douglas; Remmel, Jeffrey B. |
|
2014
|
Probabilistic algorithmic randomness. Zbl 1305.03037
Buss, Sam; Minnes, Mia |
|
2013
|
Propositional proofs and reductions between NP search problems. Zbl 1252.03127
Buss, Samuel R.; Johnson, Alan S. |
|
2012
|
Towards NP-P via proof complexity and search. Zbl 1257.03086
Buss, Samuel R. |
|
2012
|
An improved separation of regular resolution from pool resolution and clause learning. Zbl 1273.03048
Bonet, Maria Luisa; Buss, Sam |
|
2012
|
Lower complexity bounds in justification logic. Zbl 1243.03026
Buss, Samuel R.; Kuznets, Roman |
|
2012
|
Strong isomorphism reductions in complexity theory. Zbl 1248.03060
Buss, Sam; Chen, Yijia; Flum, Jörg; Friedman, Sy-David; Müller, Moritz |
|
2011
|
Corrected upper bounds for free-cut elimination. Zbl 1267.03053
Beckmann, Arnold; Buss, Samuel R. |
|
2011
|
Mathematical logic: proof theory, constructive mathematics. Abstracts fro the workshop held November 6–12, 2011. Zbl 1349.00097
|
|
2011
|
Characterising definable search problems in bounded arithmetic via proof notations. Zbl 1244.03163
Beckmann, Arnold; Buss, Samuel R. |
|
2010
|
The quantifier complexity of polynomial-size iterated definitions in first-order logic. Zbl 1209.03005
Buss, Samuel R.; Johnson, Alan S. |
|
2010
|
Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic. Zbl 1204.03056
Beckmann, Arnold; Buss, Samuel R. |
|
2009
|
The NP-completeness of reflected fragments of justification logics. Zbl 1211.03035
Buss, Samuel R.; Kuznets, Roman |
|
2009
|
Resolution trees with lemmas: resolution refinements that characterize DLL algorithms with clause learning. Zbl 1159.03009
Buss, Samuel R.; Hoffmann, Jan; Johannsen, Jan |
|
2008
|
The NP-hardness of finding a directed acyclic graph for regular resolution. Zbl 1145.03034
Buss, Samuel R.; Hoffmann, Jan |
|
2008
|
Diffusion, quantum theory, and radically elementary mathematics. Zbl 1104.81003
|
|
2006
|
Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies. Zbl 1094.03044
Buss, Samuel R. |
|
2006
|
Separation results for the size of constant-depth propositional proofs. Zbl 1089.03048
Beckmann, Arnold; Buss, Samuel R. |
|
2005
|
Mathematical logic: proof theory, type theory and constructive mathematics. Zbl 1066.03501
|
|
2005
|
A switching lemma for small restrictions and lower bounds for \(k\)-DNF resolution. Zbl 1059.03063
Segerlind, Nathan; Buss, Sam; Impagliazzo, Russell |
|
2004
|
Bounded arithmetic and constant depth Frege proofs. Zbl 1079.03050
Buss, Samuel R. |
|
2004
|
Solving the Fisher-Wright and coalescence problems with a discrete Markov chain analysis. Zbl 1070.92036
Buss, Samuel R.; Clote, Peter |
|
2004
|
Ordinal notations and well-orderings in bounded arithmetic. Zbl 1015.03055
Beckmann, Arnold; Pollett, Chris; Buss, Samuel R. |
|
2003
|
3-D computer graphics. A mathematical introduction with OpenGL. Zbl 1044.65017
Buss, Samuel R. |
|
2003
|
Resource-bounded continuity and sequentiality for type-two functionals. Zbl 1365.03029
Buss, Samuel R.; Kapron, Bruce M. |
|
2002
|
Linear gaps between degrees for the polynomial calculus modulo distinct primes. Zbl 1007.03052
Buss, Sam; Grigoriev, Dima; Impagliazzo, Russell; Pitassi, Toniann |
|
2001
|
Minimum propositional proof length is NP-hard to linearly approximate. Zbl 0977.03032
Alekhnovich, Michael; Buss, Sam; Moran, Shlomo; Pitassi, Toniann |
|
2001
|
On the computational content of intuitionistic propositional proofs. Zbl 1009.03027
Buss, Samuel R.; Pudlák, Pavel |
|
2001
|
The prospects for mathematical logic in the twenty-first century. Zbl 0981.03003
Buss, Samuel R.; Kechris, Alexander S.; Pillay, Anand; Shore, Richard A. |
|
2001
|
Accurate and efficient simulation of rigid-body rotations. Zbl 1035.70500
Buss, Samuel R. |
|
2000
|
Incompleteness of behavioral logics. Zbl 0959.03506
Buss, Samuel; Roşu, Grigore |
|
2000
|
Logic colloquium ’98. Proceedings of the annual European summer meeting of the Association for Symbolic Logic, Prague, Czech Republic, August 9–15, 1998. Zbl 0932.00038
|
|
2000
|
Propositional proof complexity: an introduction. Zbl 0946.68128
Buss, Samuel R. |
|
1999
|
The complexity of the disjunction and existential properties in intuitionistic logic. Zbl 0939.03064
Buss, Sam; Mints, Grigori |
|
1999
|
Linear gaps between degrees for the polynomial calculus modulo distinct primes. Zbl 1345.03105
Buss, Sam; Grigoriev, Dima; Impagliazzo, Russell; Pitassi, Toniann |
|
1999
|
Bounded arithmetic, proof complexity and two papers of Parikh. Zbl 0924.03106
Buss, Samuel R. |
|
1999
|
Handbook of proof theory. Zbl 0898.03001
|
|
1998
|
An introduction to proof theory. Zbl 0912.03024
Buss, Samuel R. |
|
1998
|
First-order proof theory of arithmetic. Zbl 0911.03029
Buss, Samuel R. |
|
1998
|
Resolution and the weak pigeonhole principle. Zbl 0910.03036
Buss, Sam; Pitassi, Toniann |
|
1998
|
Minimum propositional proof length is NP-hard to linearly approximate (extended abstract). Zbl 0911.03028
Alekhnovich, Michael; Buss, Sam; Moran, Shlomo; Pitassi, Toniann |
|
1998
|
Lower bounds on Nullstellensatz proofs via designs. Zbl 0890.03029
Buss, Samuel R. |
|
1998
|
Good degree bounds on Nullstellensatz refutations of the induction principle. Zbl 0921.68088
Buss, Samuel R.; Pitassi, Toniann |
|
1998
|
Linear and time minimum-cost matching algorithms for quasi-convex tours. Zbl 0913.05086
Buss, Samuel R.; Yianilos, Peter N. |
|
1998
|
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting. Zbl 0890.03030
Buss, S.; Impagliazzo, R.; Krajíček, J.; Pudlák, P.; Razborov, A. A.; Sgall, J. |
|
1997
|
Alogtime algorithms for tree isomorphism, comparison, and canonization. Zbl 0884.68098
Buss, Samuel R. |
|
1997
|
Bounded arithmetic and propositional proof complexity. Zbl 0882.68130
Buss, Samuel R. |
|
1997
|
Cutting planes, connectivity, and threshold logic. Zbl 0841.03029
Buss, Samuel R.; Clote, Peter |
|
1996
|
Are there hard examples for Frege systems? Zbl 0834.03021
Bonet, Maria Luisa; Buss, Samuel R.; Pitassi, Toniann |
|
1995
|
Relating the bounded arithmetic and polynomial time hierarchies. Zbl 0829.03035
Buss, Samuel R. |
|
1995
|
On Herbrand’s theorem. Zbl 1540.03102
Buss, Samuel R. |
|
1995
|
How to lie without being (easily) convicted and the lengths of proofs in propositional calculus. Zbl 1044.03542
Pudlák, Pavel; Buss, Samuel R. |
|
1995
|
Unprovability of consistency statements in fragments of bounded arithmetic. Zbl 0834.03022
Buss, Samuel R.; Ignjatović, Aleksandar |
|
1995
|
Some remarks on lengths of propositional proofs. Zbl 0841.03030
Buss, Samuel R. |
|
1995
|
The serial transitive closure problem for trees. Zbl 0828.68099
Bonet, Maria Luisa; Buss, Samuel R. |
|
1995
|
On Gödel’s theorems on lengths of proofs. II: Lower bounds for recognizing \(k\) symbol provability. Zbl 0829.03034
Buss, Samuel R. |
|
1995
|
An application of Boolean complexity to separation problems in bounded arithmetic. Zbl 0799.03066
Buss, Samuel R.; Krajíček, Jan |
|
1994
|
Size-depth tradeoffs for Boolean formulae. Zbl 0802.68067
Bonet, Maria Luisa; Buss, Samuel R. |
|
1994
|
On Gödel’s theorems on lengths of proofs. I: Number of lines and speedup for arithmetics. Zbl 0805.03047
Buss, Samuel R. |
|
1994
|
The witness function method and provably recursive functions of Peano arithmetic. Zbl 0829.03036
Buss, Samuel R. |
|
1994
|
Linear and \(O(n \text{log} n)\) time minimum-cost matching algorithms for quasi-convex tours. Zbl 0867.05071
Buss, Samuel R.; Yianilos, Peter N. |
|
1994
|
Algorithms for Boolean formula evaluation and for tree contraction. Zbl 0792.68046
Buss, Samuel R. |
|
1993
|
Intuitionistic validity in \(T\)-normal Kripke structures. Zbl 0802.03006
Buss, Samuel R. |
|
1993
|
The deduction rule and linear and near-linear proof simulations. Zbl 0848.03028
Bonet, Maria Luisa; Buss, Samuel R. |
|
1993
|
Provably total function in bounded arithmetic theories \(R_ 3^ i\), \(U_ 2^ i\) and \(V_ 2^ i\). Zbl 0799.03065
Buss, Samuel R.; Krajíček, Jan; Takeuti, Gaisi |
|
1993
|
An optimal parallel algorithm for formula evaluation. Zbl 0825.68424
Buss, S.; Cook, S.; Gupta, Arvind; Ramachandran, V. |
|
1992
|
A note on bootstrapping intuitionistic bounded arithmetic. Zbl 0792.03039
Buss, Samuel R. |
|
1992
|
The graph of multiplication is equivalent to counting. Zbl 0748.68018
Buss, Samuel R. |
|
1992
|
On truth-table reducibility to SAT. Zbl 0800.68443
Buss, Samuel R.; Hay, Louise |
|
1991
|
The undecidability of \(k\)-provability. Zbl 0749.03039
Buss, Samuel R. |
|
1991
|
Propositional consistency proofs. Zbl 0749.03040
Buss, Samuel R. |
|
1991
|
...and 10 more Documents |