scientific article; zbMATH DE number 1754598
From MaRDI portal
Publication:4535023
zbMath0986.68038MaRDI QIDQ4535023
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760273
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
On miniaturized problems in parameterized complexity theory ⋮ On the existence of subexponential parameterized algorithms ⋮ A Basic Parameterized Complexity Primer ⋮ On the parameterized complexity of compact set packing ⋮ Confronting intractability via parameters ⋮ On the parameterized complexity of multiple-interval graph problems ⋮ On problems without polynomial kernels ⋮ Parameterized Complexity
Uses Software
This page was built for publication:
