Parameterized and Exact Computation
From MaRDI portal
Publication:5311525
DOI10.1007/b100584zbMath1104.68053MaRDI QIDQ5311525
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100584
68Q25: Analysis of algorithms and problem complexity
68Q60: Specification and verification (program logics, model checking, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Bounded fixed-parameter tractability and reducibility, Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits