logo
Product categories

EbookNice.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link.  https://ebooknice.com/page/post?id=faq


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookNice Team

(Ebook) Logical Foundations of Proof Complexity by Stephen Cook, Phuong Nguyen ISBN 9780511677168, 9780521517294, 0511677162, 052151729X

  • SKU: EBN-2346032
Zoomable Image
$ 32 $ 40 (-20%)

Status:

Available

4.7

35 reviews
Instant download (eBook) Logical Foundations of Proof Complexity after payment.
Authors:Stephen Cook, Phuong Nguyen
Pages:497 pages.
Year:2010
Publisher:Cambridge University Press
Language:english
File Size:2.58 MB
Format:pdf
ISBNS:9780511677168, 9780521517294, 0511677162, 052151729X
Categories: Ebooks

Product desciption

(Ebook) Logical Foundations of Proof Complexity by Stephen Cook, Phuong Nguyen ISBN 9780511677168, 9780521517294, 0511677162, 052151729X

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.
*Free conversion of into popular formats such as PDF, DOCX, DOC, AZW, EPUB, and MOBI after payment.

Related Products