2 papers
cs.CC2025
The Complexity of Logarithmic Space Bounded Counting Classes
T. C. Vijayaraghavan
In this monograph, we study complexity classes that are defined using -space bounded non-deterministic Turing machines. We prove salient results of Computational Complex…
cs.CC2023
Some derivations among Logarithmic Space Bounded Counting Classes
V. Janaki, S. Madhan, T. C. Vijayaraghavan
In this paper we show derivations among logarithmic space bounded counting classes based on closure properties of that leads us to the result that .