Cook, Stephen Author
Biography not available.
Browse all ART CRITICISM books
Browse all Ashworth books
Browse all FOLKLORE books
Browse all GARDENS books
Browse all GRAPHIC NOVELS books
Browse all Hamilton books
Browse all HISTORY - MEDIEVAL books
Browse all HUMOUR books
Browse all Juvenile Fiction : Biographical - Other books
Browse all Juvenile Fiction : Historical - Other books
Browse all Juvenile Fiction : Legends, Myths, & Fables - Other books
Browse all Juvenile Fiction : People & Places - Other books
Browse all Juvenile Fiction : People & Places - United States - Other books
Browse all Juvenile Fiction : Religious - Other books
Browse all Juvenile Nonfiction : History - Other books
Browse all Juvenile Nonfiction : Mathematics - Advanced books
Browse all Juvenile Nonfiction : People & Places - Other books
Browse all Juvenile Nonfiction : People & Places - United States - Othe books
Browse all KINDRED books
Browse all LITERARY STUDIES books
Browse all LONDON books
Browse all Lozada books
Browse all Medical : Nursing - Mental Health books
Browse all MIND books
Browse all MUSEOLOGY books
Browse all NON-CLASSIFIABLE books
Browse all NONLINEAR SCIENCE books
Browse all Ormonde books
Browse all POPULAR SCIENCE books
Browse all RELIGIOUS STUDIES books
Browse all SPIRIT books
Browse all SPORT books
Browse all TRAVEL WRITING books
Out of Stock
LOGICAL FOUNDATIONS OF PROOF C
Hardback ยท ISBN 9780521517294
Inclusive of GST and other taxes
Arriving at your doorstep in 10-15 days
Our logisitcs team will make sure everyitem is delivered safely
| ISBN | 9780521517294 |
|---|---|
| Subtitle | LOGICAL FOUNDATIONS OF PROOF C |
| Publisher | Cambridge University Press |
| Publication date | April 2010 |
| Language | English |
| MRP | ยฃ110.00 GBP |
| Page count | 496 |
| Item weight | 207 g |
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. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.
Log in to write a review for this book.
No reviews yet. Be the first to share your opinion.
Biography not available.
Biography not available.