Small Dynamic Complexity Classes: An Investigation into Dynamic Descriptive Complexity (Lecture Notes in Computer Science #10110)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- 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.
- Copyright:
- 2017
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783662543146
- Related ISBNs:
- 9783662543139
- Publisher:
- Springer Berlin Heidelberg
- Date of Addition:
- 10/31/18
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics, Philosophy
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.