A Strategy for Dynamic Programs: Start over and Muddle through

DOI10.4230/LIPICS.ICALP.2017.98zbMATH Open1442.68033OpenAlexW2963302486MaRDI QIDQ5111430FDOQ5111430

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

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)

Cited In (1)

• Title not available (Why is that?)

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)