Sciweavers

COCO
1995
Springer
83views Algorithms» more  COCO 1995»
13 years 9 months ago
The Instance Complexity Conjecture
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, ...
Martin Kummer