Verwandte Artikel zu Logical Foundations of Proof Complexity Hardback (Perspectiv...
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorinnen und Autoren
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 47,49
EUR 25,36 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 129,56
EUR 13,81 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer
Suchergebnisse für Logical Foundations of Proof Complexity Hardback (Perspectiv...
Beispielbild für diese ISBN
Logical Foundations of Proof Complexity (Perspectives in Logic)
Verlag:
Cambridge University Press, 2010
ISBN 10: 052151729X
ISBN 13: 9780521517294
Gebraucht
Hardcover
Erstausgabe
Anbieter: Prior Books Ltd, Cheltenham, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: 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. Artikel-Nr. 209327
Anzahl: 1 verfügbar
Foto des Verkäufers
Logical foundations of proof complexity.
ISBN 10: 052151729X
ISBN 13: 9780521517294
Gebraucht
Hardcover
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Artikel-Nr. 2513302
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Logical Foundations of Proof Complexity (Perspectives in Logic)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9780521517294_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Logical Foundations of Proof Complexity
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 1st edition. 479 pages. 9.75x6.50x1.50 inches. In Stock. Artikel-Nr. x-052151729X
Anzahl: 2 verfügbar
Foto des Verkäufers
Logical Foundations of Proof Complexity
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9780521517294
Anzahl: 1 verfügbar