Tell your friends about this item:
Logical Foundations of Proof Complexity Cook, Stephen (University of Toronto)
Logical Foundations of Proof Complexity
Cook, Stephen (University of Toronto)
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. The result is a uniform treatment of many systems in the literature.
496 pages, 17 b/w illus. 5 tables
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | March 6, 2014 |
| ISBN13 | 9781107694118 |
| Publishers | Cambridge University Press |
| Pages | 496 |
| Dimensions | 156 × 234 × 28 mm · 752 g |
| Language | English |
Mere med samme udgiver
See all of Cook, Stephen (University of Toronto) ( e.g. Hardcover Book and Paperback Book )