Sparse parameterized problems
From MaRDI portal
Publication:2564046
DOI10.1016/0168-0072(95)00069-0zbMATH Open0863.03020DBLPjournals/apal/CesatiF96OpenAlexW2001859438WikidataQ57360100 ScholiaQ57360100MaRDI QIDQ2564046FDOQ2564046
Authors: Marco Cesati, Michael R. Fellows 
Publication date: 13 February 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(95)00069-0
Recommendations
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
- Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
- Title not available (Why is that?)
- Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory
Cited In (6)
- Finding sparse systems of parameters
- Parameterized circuit complexity and the \(W\) hierarchy
- Confronting intractability via parameters
- Parameterized complexity of sparse linear complementarity problems
- Parameterized complexity of sparse linear complementarity problems
- Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows
This page was built for publication: Sparse parameterized problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564046)
