Small dynamic complexity classes. An investigation into dynamic descriptive complexity

DOI10.1007/978-3-662-54314-6zbMATH Open1430.68004OpenAlexW4243322925MaRDI QIDQ509761FDOQ509761

Authors: Thomas Zeume 

Publication date: 20 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54314-6

Recommendations

• Dynamic complexity theory revisited
• Dynamic Complexity under Definable Changes
• STACS 2005
• Dyn-FO: A parallel, dynamic complexity class
• Publication:4490353

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Cited In (1)

• On the complexity of small description and related topics

This page was built for publication: Small dynamic complexity classes. An investigation into dynamic descriptive complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509761)