Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Prior Books Ltd, Cheltenham, Royaume-Uni
Edition originale
EUR 46,94
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. 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.
Edité par New York, Cambridge University Press; Association for Symbolic Logic, 2014
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
EUR 44,99
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. 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.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Llibreria Hispano Americana, Barcelona, B, Espagne
Edition originale
EUR 45
Quantité disponible : 1 disponible(s)
Ajouter au panierEncuadernación de tapa dura. Etat : Como Nuevo. 1ª Edición.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 124,71
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 123,52
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 138,50
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 128,07
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 128,06
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 145,11
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Cambridge University Press, Cambridge, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
EUR 148,24
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. 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.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 146,07
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Cambridge University Press, Cambridge, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : CitiRetail, Stevenage, Royaume-Uni
EUR 140,22
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Edité par Cambridge University Press CUP, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 184,46
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 496.
EUR 185,53
Quantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 1st edition. 479 pages. 9.75x6.50x1.50 inches. In Stock.
Edité par Cambridge University Press, Cambridge, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : AussieBookSeller, Truganina, VIC, Australie
EUR 174,31
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 176,56
Quantité disponible : 1 disponible(s)
Ajouter au panierBuch. Etat : 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.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 230,01
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Like New. Like New. book.
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 136,73
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 1st edition. 479 pages. 9.75x6.50x1.50 inches. In Stock. This item is printed on demand.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 142,04
Quantité disponible : Plus de 20 disponibles
Ajouter au panierHardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 860.
Edité par Cambridge University Press, 2013
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : moluna, Greven, Allemagne
EUR 139,43
Quantité disponible : Plus de 20 disponibles
Ajouter au panierGebunden. Etat : 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 .
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 193,05
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand pp. 496 17 Illus.
Edité par Cambridge University Press, 2010
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 196,28
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND pp. 496.
Edité par Cambridge University Press, 2013
ISBN 10 : 052151729X ISBN 13 : 9780521517294
Langue: anglais
Vendeur : preigu, Osnabrück, Allemagne
EUR 146,25
Quantité disponible : 5 disponible(s)
Ajouter au panierBuch. Etat : Neu. Logical Foundations of Proof Complexity | Stephen Cook (u. a.) | Buch | Gebunden | Englisch | 2013 | Cambridge University Press | EAN 9780521517294 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.