Revisiting Efficiency Definitions in Complexity Theory and the Limits of Subexponential Algorithms

The article critiques the historical reliance on polynomial time as a definition of algorithmic efficiency, highlighting its limitations and impracticality for real-world problems. It analyzes a recent subexponential algorithm for SAT, revealing that it only outperforms exponential methods in theoretically irrelevant, astronomically large problem sizes.

Comments

Read original article