Pastāsti draugiem par šo preci:
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2014. gada 6. marts |
| ISBN13 | 9781107694118 |
| Izdevēji | Cambridge University Press |
| Lapas | 496 |
| Izmēri | 156 × 234 × 28 mm · 822 g (Svars (aptuveni)) |
| Valoda | Angļu |
Vairāk no tā paša izdevēja
Skatīt visus Cook, Stephen (University of Toronto) ( piem., Hardcover Book un Paperback Book )