Edité par Amer Mathematical Society, 1997
ISBN 10 : 0821805177 ISBN 13 : 9780821805176
Langue: anglais
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
EUR 14,78
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Edité par American Mathematical Society, 1997
ISBN 10 : 0821805177 ISBN 13 : 9780821805176
Langue: anglais
Vendeur : Zubal-Books, Since 1961, Cleveland, OH, Etats-Unis
EUR 10,55
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Fine. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 13 (sale item)* 248 pp., hardcover, previous owner's name to front pastedown else fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 93,74
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
EUR 93,74
Autre deviseQuantité disponible : 10 disponible(s)
Ajouter au panierPaperback. Etat : New.
Edité par Springer New York, Springer New York, 2012
ISBN 10 : 1461268095 ISBN 13 : 9781461268093
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 94,06
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented.
Edité par Springer New York, Springer New York Sep 2012, 2012
ISBN 10 : 1461268095 ISBN 13 : 9781461268093
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 90,94
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Neuware -A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 288 pp. Englisch.
EUR 94,27
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 106,86
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 124,72
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 288.
EUR 120,71
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : New.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 135,21
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 138,03
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 134,57
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierGebunden. Etat : New. Self-contained introduction to a fundamental area in computer science Provides readers with an understanding of logic and complexity Explores applications and future directions Includes numerous examples and exercises to further illustrate the ideas present.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 94,47
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 144,02
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Springer-Verlag New York Inc., New York, NY, 2012
ISBN 10 : 1461268095 ISBN 13 : 9781461268093
Langue: anglais
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
EUR 96,63
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : new. Paperback. A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Vendeur : BennettBooksLtd, San Diego, NV, Etats-Unis
EUR 135,66
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierhardcover. Etat : New. In shrink wrap. Looks like an interesting title!
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 148,09
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Like New. Like New. book.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 122,12
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Springer-Verlag New York Inc., New York, NY, 1998
ISBN 10 : 0387986006 ISBN 13 : 9780387986005
Langue: anglais
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
EUR 123,07
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : new. Hardcover. A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
EUR 179,79
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Springer New York Nov 1998, 1998
ISBN 10 : 0387986006 ISBN 13 : 9780387986005
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 186,21
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. Neuware - A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented.
Edité par Springer-Verlag New York Inc., New York, NY, 2012
ISBN 10 : 1461268095 ISBN 13 : 9781461268093
Langue: anglais
Vendeur : AussieBookSeller, Truganina, VIC, Australie
EUR 175,58
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : new. Paperback. A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Edité par Springer-Verlag New York Inc., New York, NY, 1998
ISBN 10 : 0387986006 ISBN 13 : 9780387986005
Langue: anglais
Vendeur : AussieBookSeller, Truganina, VIC, Australie
EUR 225,91
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : new. Hardcover. A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Vendeur : moluna, Greven, Allemagne
EUR 77,17
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Self-contained introduction to a fundamental area in computer science Provides readers with an understanding of logic and complexity Explores applications and future directions Includes numerous examples and exercises to further illustrate the ideas present.
Edité par Springer New York Sep 2012, 2012
ISBN 10 : 1461268095 ISBN 13 : 9781461268093
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 90,94
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises. 288 pp. Englisch.
Edité par Springer-Verlag New York Inc., 2012
ISBN 10 : 1461268095 ISBN 13 : 9781461268093
Langue: anglais
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 111,83
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 439.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 129,85
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand pp. 288 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 131,51
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND pp. 288.