Small Dynamic Complexity Classes
Zeume, Thomas
ISBN 10: 3662543133 ISBN 13: 9783662543139
Edité par Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2017
Neuf(s)
Couverture souple
Vendeur
Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Évaluation du vendeur 5 sur 5 étoiles
Vendeur AbeBooks depuis 27 février 2001
Cet article spécifique n'est plus disponible.
A propos de cet article
Description :
Series: Lecture Notes in Computer Science. Num Pages: 149 pages, 17 black & white illustrations, biography. BIC Classification: UM; UMB; UMX; UMZ; UYA. Category: (P) Professional & Vocational. Dimension: 235 x 155. Weight in Grams: 256. . 2017. 1st ed. 2017. Paperback. . . . . N° de réf. du vendeur V9783662543139
Synopsis :
"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.
À propos de l?auteur:
Thomas Zeume received his PhD from the computer science department at the TU Dortmund University, advised by Thomas Schwentick. His research focuses on the connection of logic, complexity theory, and database theory. Thomas was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information and he received the Best Student Paper Award at the 2014 Mathematical Foundations of Computer Science conference.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Détails bibliographiques
Titre : Small Dynamic Complexity Classes
Éditeur : Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Date d'édition : 2017
Reliure : Couverture souple
Etat : New
Edition : Edition originale
Meilleurs résultats de recherche sur AbeBooks
Image d'archives
Small Dynamic Complexity Classes (Paperback)
Edité par
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2017
ISBN 10 : 3662543133
ISBN 13 : 9783662543139
Neuf
Paperback
Edition originale
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. "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. "Small Dynamic Complexity Classes" was awarded the E.W. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9783662543139
Quantité disponible : 1 disponible(s)
Image d'archives
Small Dynamic Complexity Classes (Paperback)
Edité par
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2017
ISBN 10 : 3662543133
ISBN 13 : 9783662543139
Neuf
Paperback
Edition originale
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. "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. "Small Dynamic Complexity Classes" was awarded the E.W. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9783662543139
Quantité disponible : 1 disponible(s)