Proof complexity and feasible arithmetics
Subtitle: DIMACS workshop, April 21-24, 1996
By: Paul W. Beame, Samuel R. Buss, editors.
Contributors: Beame, Paul W., 1959-; Buss, Samuel R.; DIMACS (Group); NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.; DIMACS Workshop on Feasible Arithmetics and Length of Proofs (1996 : Rutgers University)
Series: DIMACS series in discrete mathematics and theoretical computer science,; v. 39
Publisher: American Mathematical Society
Published: 1998
Place of publication: Providence, R.I
Language: eng
Number of pages: 320
Subjects: Proof theory -- Congresses.; Constructive mathematics -- Congresses.; Computational complexity -- Congresses.
Notes: Includes bibliographical references.
"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT&T Labs, Bell Labs, and Bellcore."
Papers from the proceedings of the DIMACS Workshop on Feasible Arithmetics and Length of Proofs, held on April 21-24, 1996 at Rutgers, New Jersey.