Dynamic complexity theory revisited
From MaRDI portal
Recommendations
Cited in
(21)- Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
- Dyn-FO: A parallel, dynamic complexity class
- Dynamic conjunctive queries
- The dynamic descriptive complexity of k-clique
- On the quantifier-free dynamic complexity of reachability
- Dynamic complexity theory revisited
- The dynamic complexity of formal languages
- Dynamic complexity of the Dyck reachability
- scientific article; zbMATH DE number 5972347 (Why is no real title available?)
- Dynamic Complexity under Definable Changes
- scientific article; zbMATH DE number 4052995 (Why is no real title available?)
- scientific article; zbMATH DE number 1476488 (Why is no real title available?)
- Dynamic complexity of planar 3-connected graph isomorphism
- Dynamic complexity under definable changes
- Small dynamic complexity classes. An investigation into dynamic descriptive complexity
- A strategy for dynamic programs: start over and muddle through
- Dynamic complexity of directed reachability and other problems
- Static analysis for logic-based dynamic programs
- A strategy for dynamic programs: start over and muddle through
- The dynamic complexity of formal languages
- Analysis of dynamic algorithms in Knuth's model
This page was built for publication: Dynamic complexity theory revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710680)