Kniha Logical Foundations of Proof Complexity Stephen Cook

Logical Foundations of Proof Complexity

Jazyk: Angličtina
Väzba: Brožovaná
Dostupnosť: Skladom u dodávateľa
Odosielame za 9-15 dní
79.14
This book treats bounded arithmetic and propositional proof complexity from the point of view of com...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Brožovaná
Vydalo
2014
Stránok
496
EAN
9781107694118
ISBN
1107694116
Enbook ID
02432148
Hmotnosť
76
Rozmery
156 x 234 x 28

Kompletný popis

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.

Mohlo by vás zaujímať

Proof Complexity

KRAJ EK JAN
185.30
65.44
33.35
17.70

New Rhetoric, The

Chaim Perelman
50.38
20.83
13.30

Regicide

Alain Robbe-Grillet
9.38
18.97
12.81
11.73

Phenomena

Annie Jacobsen
39.71

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Spánek a sny

Josef Hrdlička
11.32

Berserk: Ultimative Edition

John Schmitt-Weigand
15.94

Pinki & Emil

Denise Schenk
7.62

Fotbalová válka

Ryszard Kapuściński
13.86

Anaxagorás

Zdeněk Kratochvíl
9.52
13.44
24.74
8.31

PRINCESA

Princesas
3.81