|
Volumn , Issue , 1999, Pages 633-642
|
Distinguishing string selection problems
a a a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
ERROR ANALYSIS;
HEURISTIC METHODS;
LINEAR PROGRAMMING;
POLYNOMIALS;
PROBLEM SOLVING;
RELAXATION PROCESSES;
THEOREM PROVING;
POLYNOMIAL-TIME APPROXIMATION ALGORITHMS;
STRING ALGORITHMS;
ALGORITHMS;
|
EID: 0032761227
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (84)
|
References (25)
|