Answers are grounded in this paper and cite their sources.
We introduce a measure for the computational complexity of mdiwdual instances of a decision problem and study some of Its properties. The instance complexity of a string ~with respect to a set A and time bound t, ict(x : A). is defined as the size of the smallest special-case program for A that run> m time t,decides x correctly, and makes no mistakes on other strings ("don't know" answers are permitted).
No takes yet. Share an insight, caveat, or question.
Orponen et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: