NL is proven different from logCFL, implying L ≠ P and NL ≠ P.
Journal of Computer and System Sciences
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Entropy of pebble automata and space complexity
NL is proven different from logCFL, implying L ≠ P and NL ≠ P.