Answers are grounded in this paper and cite their sources.
Nancy Lynch proved that if a decision problem A is not solvable in polynomial time, then there exists an infinite recursive subset X of its domain on which the decision is almost everywhere complex. In this paper, general theorems of this kind that can be applied to several well-known automata-based complexity classes, including a common class of randomized algorithms, are proved.
No takes yet. Share an insight, caveat, or question.
Even et al. (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: