Some derivations among Logarithmic Space Bounded Counting Classes
arXiv:2310.1187431.9h-index: 4
Predicted impact top 32% in CC · last 90 daysOriginality Incremental advance
AI Analysis
It clarifies the hierarchy of space-bounded counting complexity classes, showing that NL ⊆ C_=L ⊆ PL, which is a theoretical result for complexity theorists.
The paper establishes that NL is contained in C_=L and PL by deriving relationships among logarithmic space bounded counting classes based on closure properties of #L.
In this paper we show derivations among logarithmic space bounded counting classes based on closure properties of $\#L$ that leads us to the result that $NL=C_=L\subseteq PL$.