Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

Mathematics

by: 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)

Hardcover

ISBN: 978-0-8218-0577-0

ISBN-10: 0-8218-0577-0

Amer Mathematical Society · 1997