![Coding theory / Analysis of algorithms / Computational complexity theory / Closest string / Hamming distance / Time complexity / Algorithmica / Theoretical computer science / Applied mathematics / NP-complete problems Coding theory / Analysis of algorithms / Computational complexity theory / Closest string / Hamming distance / Time complexity / Algorithmica / Theoretical computer science / Applied mathematics / NP-complete problems](https://www.pdfsearch.io/img/051cacf4c118942069c9a557cedf47b4.jpg) Date: 2013-07-26 10:03:32Coding theory Analysis of algorithms Computational complexity theory Closest string Hamming distance Time complexity Algorithmica Theoretical computer science Applied mathematics NP-complete problems | | Local Search for String Problems: Brute Force is Essentially Optimal Jiong Guo, Danny Hermelin, Christian Komusiewicz Universit¨ at des Saarlandes, Ben-Gurion University, TU Berlin & Universit´Add to Reading ListSource URL: www.cs.ucr.eduDownload Document from Source Website File Size: 209,68 KBShare Document on Facebook
|