Fundamentals of Computation Theory
DOI10.1007/b11926zbMath1278.68351OpenAlexW2249105474MaRDI QIDQ5900797
Jiong Guo, Rolf Niedermeier, Jens Gramm
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11926
computational biologyapproximation algorithmsparameterized complexityexact algorithmsalgorithms and complexity
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)
Related Items (10)
This page was built for publication: Fundamentals of Computation Theory