NL Is Strictly Contained in P
arXiv:2304.04840
Abstract
We prove that NL is strictly contained in P. We get this separation as a corollary of the following result: the set of context-free languages is not contained in NL. The reader should recall that CFL is contained in DTIME(n^3)
arXiv commentThere are gaps that must be fixed