scientific article; zbMATH DE number 512844
From MaRDI portal
Publication:4281539
zbMath0799.68086MaRDI QIDQ4281539
Michael R. Fellows, Rodney G. Downey, Karl A. Abrahamson
Publication date: 10 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Peg-solitaire, string rewriting systems and finite automata, Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues], The Birth and Early Years of Parameterized Complexity, A Basic Parameterized Complexity Primer, On fixed-parameter tractability and approximability of NP optimization problems, \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling], Unnamed Item, Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey, On input read-modes of alternating Turing machines, Fixed-parameter tractability and completeness II: On completeness for W[1], Advice classes of parametrized tractability, Sparse parameterized problems, Counting induced subgraphs: a topological approach to \#W[1-hardness]
