ISBN 9780821805770 books & textbook
Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science, 39)
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) Beame, Paul W. Buss, Samuel R.
Amer Mathematical Society /1998-01-01 Hardcover / 320 Pages
isbn-10: 0821805770 / isbn-13: 9780821805770
