Home

Samuel_R.__Buss



Algorithms for boolean formula evaluation and for tree contraction

An application of boolean complexity to separation problems in bounded arithmetic

Axiomatizations and conservation results for fragments of bounded arithmetic

Lower bounds on Nullstellensatz proofs via designs

On Godel's theorems on lengths of proofs II: Lower bounds for recognizing k symbol provability

On model theory for intuitionistic bounded arithmetic with applications to independence results

On truth-table reducibility to SAT

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

Polynomial size proofs of the propositional pigeonhole principle

Resolution proofs of generalized pigeonhole principles

Spherical averages and applications to spherical splines and interpolation

The Boolean formula value problem is in ALOGTIME

The Graph of Multiplication is Equivalent to Counting