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

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

Questions of mathematical proof and logical inference have been a significant thread in modern mathematics and have played a formative role in the development of computer science and artificial... This description may be from another edition of this product.

• Format: Hardcover
• Language: English
• ISBN: 0821805770
• ISBN13: 9780821805770
• Release Date: January 1998
• Publisher: Amer Mathematical Society
• Length: 320 Pages
• Weight: 1.70 lbs.
• Dimensions: 10.3" x 0.5" x 7.3"