scientific article
From MaRDI portal
Publication:2762493
zbMath0976.68077MaRDI QIDQ2762493
Publication date: 9 January 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2010/20100012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Classical first-order logic (03B10) Descriptive complexity and finite models (68Q19)
Related Items (10)
Tractability in constraint satisfaction problems: a survey ⋮ Describing parameterized complexity classes ⋮ The Birth and Early Years of Parameterized Complexity ⋮ A Basic Parameterized Complexity Primer ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Unnamed Item ⋮ Parameterized random complexity ⋮ First-Order Model-Checking in Random Graphs and Complex Networks ⋮ Unnamed Item ⋮ Parameterized Complexity
This page was built for publication: