2025/07/31 by T. Vijayaraghavan, Vijayaraghavan, T. C.
Mathematics · #Functional Equations Stability Results
paper · pdf · doi:10.48550/arxiv.2507.23563
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.