Artículos relacionados a Logical Foundations of Proof Complexity (Perspectives...
Sinopsis
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca de los autores
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 77,31
EUR 5,17 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Logical Foundations of Proof Complexity (Perspectives...
Imagen de archivo
Logical Foundations of Proof Complexity (Perspectives in Logic)
Publicado por
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuevo
Tapa blanda
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9781107694118_new
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Logical Foundations of Proof Complexity
Publicado por
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 479 pages. 8.75x6.00x1.00 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __1107694116
Cantidad disponible: 1 disponibles
Imagen de archivo
Logical Foundations of Proof Complexity (Perspectives in Logic)
Publicado por
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuevo
Tapa blanda
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9781107694118
Cantidad disponible: 2 disponibles
Imagen de archivo
Logical Foundations of Proof Complexity
Publicado por
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuevo
Paperback / softback
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 734. Nº de ref. del artículo: C9781107694118
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Logical Foundations of Proof Complexity (Perspectives in Logic)
Publicado por
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Antiguo o usado
Paperback
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA79011076941166
Cantidad disponible: 1 disponibles
Imagen del vendedor
Logical Foundations of Proof Complexity
Publicado por
Cambridge University Press, 2013
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 . Nº de ref. del artículo: 447223428
Cantidad disponible: Más de 20 disponibles
Edición internacional
Logical Foundations of Proof Complexity.
Publicado por
SP CAMBRIDGE UNIVERSITY PRESS, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuevo
Tapa blanda
Librería: UK BOOKS STORE, London, LONDO, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Brand New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-11 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability. Nº de ref. del artículo: CBS 9781107694118
Cantidad disponible: 1 disponibles
Imagen de archivo
Logical Foundations of Proof Complexity (Paperback)
Publicado por
Cambridge University Press, Cambridge, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuevo
Paperback
Librería: CitiRetail, Stevenage, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: new. Paperback. 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9781107694118
Cantidad disponible: 1 disponibles
Imagen del vendedor
Logical Foundations of Proof Complexity
Publicado por
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9781107694118
Cantidad disponible: 1 disponibles
Imagen de archivo
Logical Foundations of Proof Complexity
Publicado por
Cambridge University Press, 2014
ISBN 10: 1107694116
ISBN 13: 9781107694118
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 479 pages. 8.75x6.00x1.00 inches. In Stock. Nº de ref. del artículo: x-1107694116
Cantidad disponible: 2 disponibles