Entropy of pebble automata and space complexity
J. Andres Montoya
TL;DR
This paper proves that the class NL is different from logCFL, leading to the conclusion that L is different from Ptime, thus advancing understanding of space complexity class separations.
Contribution
It establishes the separation between NL and logCFL, providing new insights into the hierarchy of space complexity classes.
Findings
NL is different from logCFL
L is different from Ptime
NL is different from Ptime
Abstract
Let L denote the class Logpsace and NL the class NLogspace. We use logCFL to denote the closure under logspace reductions of the set of context-free languages. We prove that NL is different from logCFL. This result implies L different from Ptime and the stronger separation NL different from Ptime.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.