Small dynamic complexity classes : an investigation into dynamic descriptive complexity /

Saved in:

Bibliographic Details
Author / Creator:	Zeume, Thomas, author.
Imprint:	Berlin, Germany : Springer, 2017.
Description:	1 online resource (viii, 149 pages) : illustrations
Language:	English
Series:	Lecture notes in computer science, 0302-9743 ; 10110 FoLLI publications on logic, language and information LNCS sublibrary. SL 1, Theoretical computer science and general issues Lecture notes in computer science ; 10110. Lecture notes in computer science. Lecture notes in artificial intelligence. FoLLI publications on logic, language and information. LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Subject:	Computational complexity. Computational complexity. Electronic books.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11271951

Hidden Bibliographic Details
ISBN:	9783662543146 3662543141 9783662543139 3662543133
Digital file characteristics:	text file PDF
Notes:	Includes bibliographical references and index. Online resource; title from PDF title page (SpringerLink, viewed February 23, 2017).
Summary:	"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
Other form:	Print version: Zeume, Thomas. Small dynamic complexity classes. Berlin, Germany : Springer, 2017 3662543133 9783662543139
Standard no.:	10.1007/978-3-662-54314-6

Similar Items