Small Dynamic Complexity Classes [electronic resource] : An Investigation into Dynamic Descriptive Complexity /

By:

Zeume, Thomas [author.]

Contributor(s):

SpringerLink (Online service)

Material type: Text

TextSeries: Theoretical Computer Science and General Issues ; 10110Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2017Edition: 1st ed. 2017Description: VIII, 149 p. 17 illus. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783662543146

Subject(s):

Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:

004.0151 23

LOC classification:

QA75.5-76.95

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.

Tags from this library: No tags from this library for this title. Log in to add tags.

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 on this title.

to post a comment.