Immerman neil (27 risultati)
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 84,44
EUR 14,55 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 10.50x7.50x0.75 inches. In Stock.
- Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 102,46
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardback. Condizione: New. 'We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation' - from the Preface. Finite model theory can be succinctly described as the s…tudy of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. The volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' at Princeton in January 1996 during a DIMACS-sponsored Special Year on Logic and Algorithms. Each article is self-contained and provides a valuable introduction to the featured research areas connected with finite model theory.
Lingua: Inglese
Editore: Springer, 2012
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 97,72
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
Lingua: Inglese
Editore: Springer 1998-11-20, 1998
- Brossura
Da: Chiron Media, Wallingford, Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 94,85
EUR 18,03 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 10 disponibili
Paperback. Condizione: New.
Lingua: Inglese
Editore: Springer-Verlag New York Inc., US, 2012
- Brossura
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 121,98
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. 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 relationsh…ip 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. Softcover reprint of the original 1st ed. 1999.
Descriptive Complexity and Finite Models: Proceedings of a Dimacs Workshop January 14-17, 1996 Princeton University (DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE)
DIMACS Workshop On Descriptive Complexity And Finite Models (1996 : Princeton University)
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 111,54
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Condizione: New. In English.
Lingua: Inglese
Editore: Springer, 2012
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 124,78
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 288.
Descriptive Complexity and Finite Models: Proceedings of a Dimacs Workshop January 14-17, 1996 Princeton University
DIMACS Workshop on Descriptive Complexity and Finite Models (1996 : Princeton University)
- Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 125,60
EUR 9,06 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' a…t Princeton in January 1996. Editor(s): Immerman, Neil; Kolaitis, Phokion G. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 248 pages, Illustrations. BIC Classification: PBCD; PBWH. Category: (P) Professional & Vocational. Dimension: 230. Weight in Grams: 681. . 1997. hardcover. . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Springer, 1998
- Rilegato
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 137,81
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
Lingua: Inglese
Editore: Springer, 1998
- Rilegato
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.BennettBooksLtd
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 135,48
EUR 6,00 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.
Lingua: Inglese
Editore: Springer, 1998
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 140,68
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
Lingua: Inglese
Editore: Humana, 2012
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 81,80
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Descriptive Complexity | Neil Immerman | Taschenbuch | Texts in Computer Science | xvi | Englisch | 2012 | Humana | EAN 9781461268093 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Descriptive Complexity and Finite Models: Proceedings of a Dimacs Workshop January 14-17, 1996 Princeton University
DIMACS Workshop on Descriptive Complexity and Finite Models (1996 : Princeton University)
- Rilegato
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 145,08
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 1 disponibili
Condizione: New. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' a…t Princeton in January 1996. Editor(s): Immerman, Neil; Kolaitis, Phokion G. Series: DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Num Pages: 248 pages, Illustrations. BIC Classification: PBCD; PBWH. Category: (P) Professional & Vocational. Dimension: 230. Weight in Grams: 681. . 1997. hardcover. . . . .
Lingua: Inglese
Editore: Springer New York, Springer New York, 2012
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 94,06
EUR 62,21 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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.
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 90,41
EUR 75,65 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardback. Condizione: New. 'We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation' - from the Preface. Finite model theory can be succinctly described as the s…tudy of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. The volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' at Princeton in January 1996 during a DIMACS-sponsored Special Year on Logic and Algorithms. Each article is self-contained and provides a valuable introduction to the featured research areas connected with finite model theory.
Lingua: Inglese
Editore: Springer-Verlag New York Inc., US, 1998
- Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 180,58
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. 1999 ed. 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 re…lationship 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.
Lingua: Inglese
Editore: Springer, 2012
- Brossura
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Come nuovo
EUR 159,43
EUR 29,09 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Lingua: Inglese
Editore: Springer-Verlag New York Inc., US, 2012
- Brossura
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 118,39
EUR 75,65 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New. 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 relationsh…ip 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. Softcover reprint of the original 1st ed. 1999.
Lingua: Inglese
Editore: Springer-Verlag New York Inc., US, 1998
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 176,69
EUR 75,65 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. 1999 ed. 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 re…lationship 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.
Lingua: Inglese
Editore: Springer, 2012
- Brossura
- Print on Demand
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 74,24
EUR 5,50 spedizioneSpedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Condizione: new. Questo è un articolo print on demand.
Lingua: Inglese
Editore: Springer New York Sep 2012, 2012
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 90,94
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: 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 non…deterministic 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.
Lingua: Inglese
Editore: Springer New York, 2012
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 77,17
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: 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 exercise…s to further illustrate the ideas present.
Lingua: Inglese
Editore: Springer-Verlag New York Inc., 2012
- Brossura
- Print on Demand
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 113,52
EUR 17,62 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Lingua: Inglese
Editore: Springer, 2012
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 127,85
EUR 7,56 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: 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.
Lingua: Inglese
Editore: Springer, 2012
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 131,22
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 288.
Lingua: Inglese
Editore: Humana, Springer Sep 2012, 2012
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 90,94
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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 b…e 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.Libri GmbH, Europaallee 1, 36244 Bad Hersfeld 288 pp. Englisch.
Lingua: Inglese
Editore: Springer New York, 1998
- Rilegato
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 110,71
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Gebunden. Condizione: 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 an…d exercises to further illustrate the ideas present.
