Publicado por Amer Mathematical Society, 1997
ISBN 10: 0821805177 ISBN 13: 9780821805176
Idioma: Inglés
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
EUR 16,59
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.45.
Publicado por American Mathematical Society, 1997
ISBN 10: 0821805177 ISBN 13: 9780821805176
Idioma: Inglés
Librería: Zubal-Books, Since 1961, Cleveland, OH, Estados Unidos de America
EUR 12,51
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Fine. 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.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 93,34
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Springer New York, Springer New York, 2012
ISBN 10: 1461268095 ISBN 13: 9781461268093
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 94,06
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
EUR 92,96
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
EUR 93,34
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 105,36
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 87,40
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
EUR 110,21
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Publicado por Springer New York, Springer New York Sep 2012, 2012
ISBN 10: 1461268095 ISBN 13: 9781461268093
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 90,94
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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 122,96
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 288.
EUR 119,02
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 113,48
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 134,63
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 136,09
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 134,76
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: 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.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 93,15
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 141,99
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Publicado por Springer-Verlag New York Inc., New York, NY, 2012
ISBN 10: 1461268095 ISBN 13: 9781461268093
Idioma: Inglés
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
EUR 96,63
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: BennettBooksLtd, San Diego, NV, Estados Unidos de America
EUR 133,75
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
EUR 171,99
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 1998. Hardcover. . . . . .
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 120,40
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Springer-Verlag New York Inc., New York, NY, 1998
ISBN 10: 0387986006 ISBN 13: 9780387986005
Idioma: Inglés
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
EUR 121,35
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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.
Publicado por Springer New York Nov 1998, 1998
ISBN 10: 0387986006 ISBN 13: 9780387986005
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 186,21
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: 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.
Publicado por Springer-Verlag New York Inc., New York, NY, 2012
ISBN 10: 1461268095 ISBN 13: 9781461268093
Idioma: Inglés
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 173,57
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
EUR 213,31
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 1998. Hardcover. . . . . . Books ship from the US and Ireland.
Publicado por Springer-Verlag New York Inc., New York, NY, 1998
ISBN 10: 0387986006 ISBN 13: 9780387986005
Idioma: Inglés
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 223,32
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: 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.
Librería: moluna, Greven, Alemania
EUR 77,17
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: 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.
Publicado por Springer New York Sep 2012, 2012
ISBN 10: 1461268095 ISBN 13: 9781461268093
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 90,94
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Publicado por Springer-Verlag New York Inc., 2012
ISBN 10: 1461268095 ISBN 13: 9781461268093
Idioma: Inglés
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 111,36
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 439.