Back to Results
First PageMeta Content
Analysis of algorithms / NP-complete problems / Closest string / Randomized algorithm / String / Time complexity / Algorithm / 2-satisfiability / NP / Theoretical computer science / Computational complexity theory / Applied mathematics


Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with
Add to Reading List

Document Date: 2014-06-14 17:20:02

Open Document

File Size: 606,33 KB

Share Result on Facebook
UPDATE