Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Logical Foundations of Proof Complexity

Name: Logical Foundations of Proof Complexity
Brand: Cambridge University Press
SKU: 02432148
Price: 33416 HUF
Availability: InStock
Author: Stephen Cook
ISBN: 9781107694118

Stephen Cook

Phuong Nguyen

Language

English

Book Paperback

Libristo code: 02432148

Publishers Cambridge University Press, March 2014

This book treats bounded arithmetic and propositional proof complexity from the point of view of com... Full description

Libristo code: 02432148

223 b

33 416 Ft

In stock at our supplier Shipping in 14-21 days

Up to 30 days for returns

Customers also purchased

Tajemnice XX wieku. Ludzie, sensacje, wydarzenia Krzysztof Bochus

Hardback

3 927 Ft

?QUIÉN ERES TÚ Y QUÉ HACES AQUÍ? El libro de iO Jesús Yanes

Paperback

6 880 Ft

Nejsem jenom sestra: Má práce a život v Saúdské Arábii Hana Šlechtová

Paperback

3 534 Ft

Anaxagorás Zdeněk Kratochvíl

Paperback

3 643 Ft

Spánek a sny Josef Hrdlička

Sheet

3 865 Ft

Caravelle CM1 - Cahier élève 2023 NOIZET

Book

3 879 Ft

Hafenmanöver Schritt für Schritt - mit dem Motorboot Christian Tiedt

Paperback

7 820 Ft

Berserk: Ultimative Edition John Schmitt-Weigand

Paperback

6 577 Ft

Objevujeme úžasný svět Věda není nuda

Paperback

2 849 Ft

Alternativy (dějin) filosofie Zdeněk Kratochvíl

Paperback

5 169 Ft

Russian for Advanced Learners - Russkii Iazyk dlia prodvinutykh K. Rogova

Paperback

21 367 Ft

Livro para Colorir de Pinguins 2 Nick Snels

Paperback

2 953 Ft

Hiszpańska Gramatyka obrazkowa w ćwiczeniach Opracowanie zbiorowe

Paperback

4 375 Ft

PRINCESA Princesas

Book

1 422 Ft

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 complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated 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.