<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2007-02-16 07:21:01Complexity classes NP-complete problems Closest string Parameterized complexity Clique problem Vertex cover Polynomial-time approximation scheme String Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics |
| PDF DocumentDocID: 1iOqz - View Document |
| Finding Optimal Alignment and Consensus of Circular Strings T. Lee*, J.C. Na, H. Park, K. Park, and J.S. Sim *Seoul National University June 23, 2010DocID: 15EfY - View Document |
| Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint withDocID: 15Cdq - View Document |
| Custom Care Spare Parts Bars CUSTOM CARE PARTS – SEAT COMPONENT ORDERS CAN BE MADE BY CONTACTING YOUR CLOSEST CUSTOM CARE NEW SOUTH WALES & ACTDocID: 14ZES - View Document |
| Matrix multiplication and pattern matching under Hamming norm Rapha¨el Clifford January 23, 2009 Abstract My understanding of a conversation with Ely Porat who in turn attributes Piotr Indyk.DocID: 14uPM - View Document |