A strategy for dynamic programs: start over and muddle through

DOI10.4230/LIPICS.ICALP.2017.98MaRDI QIDQ5111430zbMATH OpenOpenAlexFDO

Authors Samir Datta, A. Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.ICALP.2017.98

zbMATH Keywords

treewidthmonadic second-order logicdynamic complexity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Database theory (68P15) Logic in computer science (03B70)

Recommendations

• A strategy for dynamic programs: start over and muddle through
• Static analysis for logic-based dynamic programs
• STACS 2005
• Dynamic complexity under definable changes
• Dyn-FO: A parallel, dynamic complexity class

Cited in

(3)

• Static analysis for logic-based dynamic programs
• A strategy for dynamic programs: start over and muddle through
• Reachability and distances under multiple changes

This page was built for publication: A strategy for dynamic programs: start over and muddle through

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