Logical Foundations Of Proof Complexity (perspectives In Logic)

79.82 Brand New 5 In stock! Order now!
Brand: Cambridge University Press
SKU: DADAX052151729X
ISBN : 052151729X

Domestic Shipping:$6.95
International Shipping: Add $20.
Qty: - +
   - OR -   
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.
Author : Stephen Cook
ISBN : 052151729X
Language : English
No of Pages : 496
Edition : 1
Publication Date : 1/25/2010
Format/Binding : Hardcover
Book dimensions : 9.3x6.2x1.3
Book weight : 0.02

Write a review

Your Name:

Your Email

Your Review: Note: HTML is not translated!

Rating: Bad           Good

Enter the code in the box below: