Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Logical Foundations of Proof Complexity - Stephen Cook,Phuong Nguyen

inglise keel
2013-10-11
181,80 € 303,00 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 17-23 tööpäeva jooksul

30-päevane tagastamisõigus

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 propositi ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Stephen Cook, Phuong Nguyen
Kirjastaja Cambridge University Press
Väljalaskeaasta 2013
Kaanetüüp Kõvakaaneline
EAN 9780521517294
Kirjuta oma arvustus
Te vaatate: Logical Foundations of Proof Complexity
Teie hinnang:

Goodreads'i arvustused

181,80 € 303,00 €