Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity /
Zeume, Thomas.
Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity / [electronic resource] : by Thomas Zeume. - 1st ed. 2017. - VIII, 149 p. 17 illus. online resource. - Theoretical Computer Science and General Issues, 10110 2512-2029 ; . - Theoretical Computer Science and General Issues, 10110 .
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.
9783662543146
10.1007/978-3-662-54314-6 doi
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 Techniques.
QA75.5-76.95
004.0151
Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity / [electronic resource] : by Thomas Zeume. - 1st ed. 2017. - VIII, 149 p. 17 illus. online resource. - Theoretical Computer Science and General Issues, 10110 2512-2029 ; . - Theoretical Computer Science and General Issues, 10110 .
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.
9783662543146
10.1007/978-3-662-54314-6 doi
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 Techniques.
QA75.5-76.95
004.0151