Fortell venner om denne varen:
Arithmetic, Proof Theory, and Computational Complexity - Oxford Logic Guides Peter Clote
Pris
NOK 1.319
Bestillingsvarer
Forventes levert 8. - 22. okt
Få varsel om nye utgivelser fra Peter Clote
Legg til iMusic ønskeliste
eller
Arithmetic, Proof Theory, and Computational Complexity - Oxford Logic Guides
Peter Clote
This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of references.
442 pages, line figures
| Media | Bøker Innbunden bok (Bok med hard rygg og stivt omslag) |
| Utgitt | 6. mai 1993 |
| ISBN13 | 9780198536901 |
| Utgivere | Oxford University Press |
| Antall sider | 442 |
| Mål | 162 × 242 × 30 mm · 810 g |
| Språk | Engelsk |
| Redaktør | Clote, Peter (Professor, Department of Computer Science, Professor, Department of Computer Science, Boston College, Chestnut Hill, USA) |
| Redaktør | Krajicek, Jan (Mathematical Institute, Mathematical Institute, Ceskoslovenska Akademie Ved Praha 1, Czechoslovakia) |