Some derivations among Logarithmic Space Bounded Counting Classes
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$.
cs.CC↗
arXiv subjects
T. C. Vijayaraghavan
Publications and source records attributed to T. C. Vijayaraghavan.
The Complexity of Logarithmic Space Bounded Counting Classes
In this monograph, we study complexity classes that are defined using $O(\log n)$-space bounded non-deterministic Turing machines. We prove salient results of Computational Complexity in this topic such as the Immerman-Szelepcsenyi Theorem, the Isolating Lemma, theorems of Meena Mahajan and V. Vinay on the determinant and many consequences of these very important results. The manuscript is intended to be a comprehensive textbook on the topic of The Complexity of Logarithmic Space Bounded Counting Classes.
cs.CC↗