On the existence of subexponential parameterized algorithms
type: Item
instance of: scholarly article
title: On the existence of subexponential parameterized algorithms
zbMATH Open document ID: 1091.68121
DOI: 10.1016/S0022-0000(03)00074-6
published in: Journal of Computer and System Sciences
publication date: 2004-08-19T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 2092874
author: Liming Cai
author: David W. Juedes
MaRDI profile type: Publication
cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
cites work: Q2721971
cites work: Q4535799
cites work: Faster exact algorithms for hard problems: A parameterized point of view
cites work: An improved fixed-parameter algorithm for vertex cover
cites work: The Complexity of Decision Versus Search
cites work: Nondeterminism within $P^ * $
cites work: On fixed-parameter tractability and approximability of NP optimization problems
cites work: On the structure of parameterized problems in NP
cites work: Circuit Bottom Fan-in and Computational Power
cites work: Q4535023
cites work: Vertex cover: Further observations and further improvements
cites work: Introduction to algorithms
cites work: Q4850549
cites work: Q4503944
cites work: Q4263467
cites work: Some simplified NP-complete graph problems
cites work: Which problems have strongly exponential complexity?
cites work: Vertex packings: Structural properties and algorithms
cites work: Q4251072
cites work: A general method to speed up fixed-parameter-tractable algorithms
cites work: Optimization, approximation, and complexity classes
Recommended article: Subexponential Parameterized Algorithms
Recommended article: Subexponential parameterized algorithms
Recommended article: Parameterized Complexity and Subexponential-Time Computability
Recommended article: Parameterized (in)approximability of subset problems
Recommended article: Parameterized and subexponential-time complexity of satisfiability problems and applications
Recommended article: Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications
Recommended article: An Isomorphism Between Subexponential and Parameterized Complexity Theory
Recommended article: Q2965491
Recommended article: Q4535023
Recommended article: Subexponential parameterized algorithms for graphs of polynomial growth
description: scientific article; zbMATH DE number 2092874