Answers are grounded in this paper and cite their sources.
Computational complexity lower bounds like P ≠ NP assert impossibility results for all possible programs of some restricted form. As there are presently enormous gaps in our lower bound knowledge, a central question on the minds of today's complexity theorists is how will we find better ways to reason about all efficient programs?
No takes yet. Share an insight, caveat, or question.
Ryan Williams (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: