Dynamic complexity under definable changes

DOI10.1145/3241040MaRDI QIDQ5012593zbMATH OpenOpenAlexWikidataFDO

Authors Thomas Schwentick, Nils Vortmeier, Thomas Zeume

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2017/7059/

zbMATH Keywords

dynamic descriptive complexitydynamic programsSQL updates

Mathematics Subject Classification ID

Logic in computer science (03B70) Database theory (68P15) Descriptive complexity and finite models (68Q19)

Recommendations

• Dynamic Complexity under Definable Changes
• STACS 2005
• On the Quantifier-Free Dynamic Complexity of Reachability
• Reachability and distances under multiple changes
• Reachability is in DynFO

Cited in

(12)

• Action complexity in the presence of defects and boundaries
• On the quantifier-free dynamic complexity of reachability
• The dynamic descriptive complexity of \(k\)-clique
• Dynamic Complexity under Definable Changes
• Reachability and distances under multiple changes
• scientific article; zbMATH DE number 7471669 (Why is no real title available?)
• A strategy for dynamic programs: start over and muddle through
• Dynamic graph queries
• Static analysis for logic-based dynamic programs
• A strategy for dynamic programs: start over and muddle through
• STACS 2005
• Direct access for answers to conjunctive queries with aggregation

This page was built for publication: Dynamic complexity under definable changes

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