NL Is Strictly Contained in P
Formal Languages and Automata Theory
2024-04-25 v4
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)
Cite
@article{arxiv.2304.04840,
title = {NL Is Strictly Contained in P},
author = {Santiago Flum and J. Andres Montoya},
journal= {arXiv preprint arXiv:2304.04840},
year = {2024}
}
Comments
There is a gap that cannot be fixed