Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 59,51
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 67,31
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,39
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 60,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 64,93
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Springer-Verlag New York Inc, 2017
ISBN 10: 3662543133 ISBN 13: 9783662543139
Da: Revaluation Books, Exeter, Regno Unito
EUR 76,29
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 149 pages. 9.00x6.00x0.50 inches. In Stock.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2017
ISBN 10: 3662543133 ISBN 13: 9783662543139
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 'Small Dynamic Complexity Classes' was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information. The thesis studies the foundations of query re-evaluation after modifying a database. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. One of the contributions to the former aspect helped to confirm the conjecture by Patnaik and Immerman (1997) that reachability can be maintained by first-order update formulas.
Da: preigu, Osnabrück, Germania
EUR 50,35
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Small Dynamic Complexity Classes | An Investigation into Dynamic Descriptive Complexity | Thomas Zeume | Taschenbuch | viii | Englisch | 2017 | Springer | EAN 9783662543139 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: Buchpark, Trebbin, Germania
EUR 40,42
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | "Small Dynamic Complexity Classes" was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information. The thesis studies the foundations of query re-evaluation after modifying a database. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. One of the contributions to the former aspect helped to confirm the conjecture by Patnaik and Immerman (1997) that reachability can be maintained by first-order update formulas.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 46,22
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Lingua: Inglese
Editore: Springer Berlin Heidelberg Feb 2017, 2017
ISBN 10: 3662543133 ISBN 13: 9783662543139
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -'Small Dynamic Complexity Classes' was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information. The thesis studies the foundations of query re-evaluation after modifying a database. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. One of the contributions to the former aspect helped to confirm the conjecture by Patnaik and Immerman (1997) that reachability can be maintained by first-order update formulas. 160 pp. Englisch.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2017
ISBN 10: 3662543133 ISBN 13: 9783662543139
Da: moluna, Greven, Germania
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Up-to-date resultsExtensive study of the power of logics in dynamic settingsDocument of the progress in dynamic complexityThomas Zeume received his PhD from the computer science department at .
Da: Majestic Books, Hounslow, Regno Unito
EUR 101,30
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 102,17
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.
Lingua: Inglese
Editore: Springer, Springer Feb 2017, 2017
ISBN 10: 3662543133 ISBN 13: 9783662543139
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -'Small Dynamic Complexity Classes' was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information. The thesis studies the foundations of query re-evaluation after modifying a database. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. One of the contributions to the former aspect helped to confirm the conjecture by Patnaik and Immerman (1997) that reachability can be maintained by first-order update formulas.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 160 pp. Englisch.