Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996 / Paul W. Beame, Samuel R. Buss, editors.

Bibliographic Details

Corporate Authors:	DIMACS (Group) NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science DIMACS Workshop on Feasible Arithmetics and Length of Proofs
Other Authors:	Beame, Paul W., 1959- Buss, Samuel R.
Language:	English
Published:	Providence, R.I. : American Mathematical Society, [1998], ©1998.
Series:	DIMACS series in discrete mathematics and theoretical computer science ; v. 39.
Subjects:	Proof theory > Congresses. Constructive mathematics > Congresses. Computational complexity > Congresses.
Genre:	Congresses.
Physical Description:	xii, 320 pages : illustrations ; 26 cm.
Format:	Conference Proceeding Book