Sam Buss
Sam Buss
Professor of Mathematics and Computer Science
Email verificata su - Home page
TitoloCitata daAnno
Bounded arithmetic
SR Buss
Bibliopolis, 1986
Introduction to inverse kinematics with jacobian transpose, pseudoinverse and damped least squares methods
SR Buss
University of California, San Diego, Typeset manuscript, available from http …, 2004
Spherical averages and applications to spherical splines and interpolation
SR Buss, JP Fillmore
ACM Transactions on Graphics (TOG) 20 (2), 95-126, 2001
Handbook of proof theory
SR Buss
Elsevier, 1998
The Boolean formula value problem is in ALOGTIME
SR Buss
Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987
Selectively damped least squares for inverse kinematics
SR Buss, JS Kim
Journal of Graphics tools 10 (3), 37-49, 2005
An introduction to proof theory
SR Buss
Handbook of proof theory 137, 1-78, 1998
3-D computer graphics: a mathematical introduction with OpenGL
SR Buss
Cambridge Univ Pr, 2003
Polynomial size proofs of the propositional pigeonhole principle
SR Buss
The Journal of Symbolic Logic 52 (4), 916-927, 1987
On truth-table reducibility to SAT
SR Buss, L Hay
Information and Computation 91 (1), 86-102, 1991
Linear gaps between degrees for the polynomial calculus modulo distinct primes
S Buss, D Grigoriev, R Impagliazzo, T Pitassi
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
An optimal parallel algorithm for formula evaluation
SR Buss, S Cook, A Gupta, V Ramachandran
SIAM J. Comput. 21 (4), 755-780, 1992
Resolution proofs of generalized pigeonhole principles
SR Buss, G Turán
Theoretical Computer Science 62 (3), 311-317, 1988
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
S Buss, R Impagliazzo, J Krajíček, P Pudlák, AA Razborov, J Sgall
Computational Complexity 6 (3), 256-298, 1996
The undecidability of k-provability
SR Buss
Annals of Pure and Applied Logic 53 (1), 75-102, 1991
First-order proof theory of arithmetic
SR Buss
Studies in Logic and the Foundations of Mathematics 137, 79-147, 1998
A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution
N Segerlind, S Buss, R Impagliazzo
SIAM Journal on Computing 33 (5), 1171-1200, 2004
Switching lemma for small restrictions and lower bounds for k-DNF resolution
N Segerlind, S Buss, R Impagliazzo
Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE …, 2002
Resolution and the weak pigeonhole principle
S Buss, T Pitassi
Computer Science Logic, 149-156, 1998
An application of Boolean complexity to separation problems in bounded arithmetic
SR Buss, J Krajicek
Proceedings of the London Mathematical Society 69 (1), 1-21, 1994
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20