Fundamentals of Computation Theory
From MaRDI portal
Publication:5900798
DOI10.1007/b11926zbMath1278.68350MaRDI QIDQ5900798
Patricia A. Evans, Andrew D. Smith
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
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
92-08: Computational methods for problems pertaining to biology
68W32: Algorithms on strings
Related Items
Randomized fixed-parameter algorithms for the closest string problem, A three-string approach to the closest string problem