scientific article; zbMATH DE number 2086399
From MaRDI portal
Publication:4736854
zbMath1054.68063MaRDI QIDQ4736854
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2285/22850359.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)
Related Items
The complexity of first-order and monadic second-order logic revisited, A Basic Parameterized Complexity Primer, Computing Hitting Set Kernels By AC^0-Circuits, Edge-treewidth: algorithmic and combinatorial properties, A survey of the algorithmic aspects of modular decomposition, Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits, A parametric analysis of the state-explosion problem in model checking, Unnamed Item, Parameterized Complexity, EPTAS for load balancing problem on parallel machines with a non-renewable resource, Parameterized computation and complexity: a new approach dealing with NP-hardness
