Mao Zedong - The Cambridge China Library
Tell your friends about this item:
Ordered from remote warehouse
Christmas presents can be returned until 31 January
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 · 822 g (Weight (estimated)) |
| Language | English |