Publication:4535023
From MaRDI portal
zbMath0986.68038MaRDI QIDQ4535023
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760273
90C60: Abstract computational complexity for mathematical programming problems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Confronting intractability via parameters, On miniaturized problems in parameterized complexity theory, On the parameterized complexity of multiple-interval graph problems, On problems without polynomial kernels, On the existence of subexponential parameterized algorithms, Parameterized Complexity, A Basic Parameterized Complexity Primer
Uses Software