Model Checking Lower Bounds for Simple Graphs

DOI10.1007/978-3-642-39206-1_57zbMath1336.68165arXiv1302.4266OpenAlexW1615659948MaRDI QIDQ5326601

Michael Lampis

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.4266

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

On low tree-depth decompositions ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Model Checking Lower Bounds for Simple Graphs