T. C. Vijayaraghavan

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2025

The Complexity of Logarithmic Space Bounded Counting Classes

T. C. Vijayaraghavan

In this monograph, we study complexity classes that are defined using $O (lo g n)$ -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 $# L$ that leads us to the result that $N L = C_{=} L \subseteq P L$ .