Bemærk: Kan ikke leveres før jul.
Forventes på lager: 25-01-2010
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.
| Forlag | Cambridge University Press |
| Forfattere | Stephen (University of Toronto) Cook, Phuong (McGill University Nguyen |
| Type | Bog |
| Format | Hardback |
| Sprog | Engelsk |
| Udgivelsesdato | 25-01-2010 |
| Første udgivelsesår | 2010 |
| Illustrationer | 5 Tables, unspecified; 17 Line drawings, unspecified |
| Originalsprog | United Kingdom |
| Sideantal | 496 |
| Indbinding | Hardback |
| Forlag | Cambridge University Press |
| Sideoplysninger | 496 pages, 5 Tables, unspecified; 17 Line drawings, unspecified |
| Mål | 234 x 156 x 32 |
| ISBN-13 / EAN-13 | 9780521517294 |