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)
Sold by Ria Christie Collections, Uxbridge, United Kingdom
AbeBooks Seller since March 25, 2015
New - Hardcover
Condition: New
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Add to basket