scientific article
From MaRDI portal
Publication:2735980
zbMath0977.68058MaRDI QIDQ2735980
Publication date: 26 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityfirst-order logicmonadic second-order logicdecision problemmodel-checking problem
Analysis of algorithms and problem complexity (68Q25) 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 (4)
Courcelle's theorem -- a game-theoretic approach ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ A Practical Approach to Courcelle's Theorem ⋮ Parameterized counting problems
This page was built for publication:
