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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Stephen Cook is a professor at the University of Toronto. He is author of many research papers, including his famous 1971 paper 'The Complexity of Theorem Proving Procedures', and the 1982 recipient of the Turing Award. He was awarded a Steacie Fellowship in 1977 and a Killam Research Fellowship in 1982 and received the CRM/Fields Institute Prize in 1999. He is a Fellow of the Royal Society of London and the Royal Society of Canada and was elected to membership in the National Academy of Sciences (United States) and the American Academy of Arts and Sciences.
Phuong Nguyen (Nguyễn Thế Phương) received his MSc and PhD degrees from University of Toronto in 2004 and 2008 respectively. He has been awarded postdoctoral fellowships by the Eduard Čech Center for Algebra and Geometry (the Czech Republic) for 2008–9, and by the Natural Sciences and Engineering Research Council of Canada (NSERC), effective September 2009.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 25,34 expédition depuis Royaume-Uni vers Etats-Unis
Destinations, frais et délaisEUR 3,42 expédition vers Etats-Unis
Destinations, frais et délaisVendeur : Prior Books Ltd, Cheltenham, Royaume-Uni
Hardcover. Etat : Like New. First Edition. A firm and square hardback with sharp corners and strong joints, just showing a few very minor cosmetic rubs. Hence a non-text page has a small 'damaged' stamp. Despite such this book is actually in nearly new condition and appears unread. Thus the contents are crisp, fresh and tight; no pen-marks. Now offered for sale at a very sensible price. N° de réf. du vendeur 209327
Quantité disponible : 1 disponible(s)
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Hardcover. Paperback ed. XV, 479 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. D03601 9780521517294 Sprache: Englisch Gewicht in Gramm: 1150. N° de réf. du vendeur 2513302
Quantité disponible : 1 disponible(s)
Vendeur : Llibreria Hispano Americana, Barcelona, B, Espagne
Encuadernación de tapa dura. Etat : Como Nuevo. 1ª Edición. N° de réf. du vendeur 92-*-*-*
Quantité disponible : 1 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Feb2416190005161
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 8228618-n
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9780521517294
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9780521517294_new
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 8228618
Quantité disponible : Plus de 20 disponibles
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Hardcover. Etat : new. Hardcover. 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. 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. The result is a uniform treatment of many systems in the literature. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780521517294
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 8228618-n
Quantité disponible : Plus de 20 disponibles