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 - Closest string - Document - PDFSEARCH.IO

First Page	Meta Content
	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 List Document Date: 2013-07-26 10:03:32 Open Document File Size: 209,68 KB Share Result on Facebook Facility Ben-Gurion University / / IndustryTerm local search problem / local search algorithms / local search problems / Generic local search algorithm / parameterized local search / local search / feasible solutions / / Organization Brute Force / Ben-Gurion University / / Person Danny Hermelin / Christian Komusiewicz Universit / / Technology local search algorithms / Generic local search algorithm / time algorithm / / SocialTag Coding 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 List