Paperback. "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. "Small Dynamic Complexity Classes" was awarded the E.W. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9783662543139

Contact seller

Report this item

Bibliographic Details

Title: Small Dynamic Complexity Classes (Paperback)
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
Publication Date: 2017
Language: English
ISBN 10: 3662543133
ISBN 13: 9783662543139
Binding: Paperback
Edition: 1st Edition
Condition: new

About this title

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.

About the Author

Thomas Zeume received his PhD from the computer science department at the TU Dortmund University, advised by Thomas Schwentick. His research focuses on the connection of logic, complexity theory, and database theory. Thomas was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information and he received the Best Student Paper Award at the 2014 Mathematical Foundations of Computer Science conference.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

APOLLO ONLINE CORP.
605 Geddes Street, Wilmington, DE, 19805, U.S.A.

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it�s described on the Abebooks web sites. If you�ve changed
your mind about a book that you�ve ordered, please use the Ask bookseller a question link to contact us
and we�ll respond within 2 business days.
Books ship from California and Michigan.

Right of cancellation

Shipping Terms

Orders usually ship within 2 business days. All books within the US ship free of charge. Delivery is 4-14 business days anywhere in the United States.

Books ship from California and Michigan.

If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	6 to 16 business days	6 to 14 business days
First item	� 0.00	� 0.00

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.