COCO
1995
Springer
13 years 11 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
COCO
1995
Springer
13 years 11 months ago
1995
Springer
COCO
1995
Springer
13 years 11 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
COCO
1995
Springer
13 years 11 months ago
1995
Springer
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
COCO
1995
Springer
13 years 11 months ago
1995
Springer
COCO
1995
Springer
13 years 11 months ago
1995
Springer
