The Complexity of Logarithmic Space Bounded Counting Classes
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912966636470272 |
|---|---|
| author | Vijayaraghavan, T. C. |
| author_facet | Vijayaraghavan, T. C. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_23563 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Complexity of Logarithmic Space Bounded Counting Classes Vijayaraghavan, T. C. Computational Complexity 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. |
| title | The Complexity of Logarithmic Space Bounded Counting Classes |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2507.23563 |