Central Library

Normal view MARC view ISBD view

Small Dynamic Complexity Classes [electronic resource] : An Investigation into Dynamic Descriptive Complexity / by Thomas Zeume.

By: Zeume, Thomas [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 10110Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2017Edition: 1st ed. 2017.Description: VIII, 149 p. 17 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783662543146.Subject(s): Computer science | Software engineering | Machine theory | Compilers (Computer programs) | Algorithms | Computer programming | Computer Science Logic and Foundations of Programming | Software Engineering | Formal Languages and Automata Theory | Compilers and Interpreters | Algorithms | Programming TechniquesAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
Contents:
Dynamic Complexity: Definitions and Examples -- Relating Small Dynamic Complexity Classes -- Lower Bounds for Dynamic Complexity Classes. .
In: Springer Nature eBookSummary: "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.
    average rating: 0.0 (0 votes)
No physical items for this record

Dynamic Complexity: Definitions and Examples -- Relating Small Dynamic Complexity Classes -- Lower Bounds for Dynamic Complexity Classes. .

"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.

There are no comments for this item.

Log in to your account to post a comment.