Small Dynamic Complexity Classes: An Investigation Into Dynamic Descriptive Complexity

By Funny Notebooks

"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.

• Format: Paperback
• Language: English
• ISBN: 3662543133
• ISBN13: 9783662543139
• Release Date: February 2017
• Publisher: Springer
• Length: 149 Pages
• Weight: 0.51 lbs.
• Dimensions: 0.3" x 6.1" x 9.2"

Customer Reviews

Comprehensive.

If you're involved in any aspect of applied mathematics, this book is worth its weight in gold. It is probably considered somewhat obscure in the US, since it's a Swedish book that isn't really marketed outside of Sweden, but I haven't seen anything as comprehensive anywhere. The book contains all the formulae, theorems and tables that any student or professional involved with mathematics or engineering could hope for...

A great 'dictionary' of Mathematics

I have found Beta Mathematics Handbook to be the most organized, informative, concise and well-written reference for mathematics of all levels, esp. for probabilities and statistics. I highly recommend it. A must in every mathematician's bookshelf.