The Complexity Of Class Polyl

Frank Vega
2018 Zenodo  
We define the class polyL as the set of languages that can be decided in deterministic polylogarithmic space. We prove every language in NP is in polyL. In this way, we show every language in P is in polyL. Moreover, since every language in polyL is in QP, then every problem in NP can be decided in a quasi-polynomial time.
doi:10.5281/zenodo.1322863 fatcat:kuq5gyzasbhwnbfb4c75miv5im