Image de couverture de livre

The Complexity of Logarithmic Space Bounded Counting Classes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Vijayaraghavan, T. C.
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Some derivations among Logarithmic Space Bounded Counting Classes
par: Janaki, V., et autres
Publié: (2023)

Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies
par: Gajulapalli, Karthik, et autres
Publié: (2025)

Algorithmic Structure in Subset Sum: Deterministic In-Bound Navigation and the Counting Complexity Divide
par: Nkosi, Thami
Publié: (2025)

Improved Bounds on the Space Complexity of Circuit Evaluation
par: Shalunov, Yakov
Publié: (2025)

Counting Martingales for Measure and Dimension in Complexity Classes
par: Hitchcock, John M., et autres
Publié: (2025)

Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting
par: Grossman, Ofer, et autres
Publié: (2023)

Low Sets and Closure Properties of Counting Function Classes
par: Ivanashev, Yaroslav
Publié: (2025)

Lower Bounds for Subset Sum in Resolution with Modular Counting
par: Part, Fedor
Publié: (2022)

Reasonable Space for the $λ$-Calculus, Logarithmically
par: Accattoli, Beniamino, et autres
Publié: (2022)

Structure in Communication Complexity and Constant-Cost Complexity Classes
par: Hatami, Hamed, et autres
Publié: (2024)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)

On Bounded Advice Classes
par: Marshall, Simon, et autres
Publié: (2024)

Unifying the Landscape of Super-Logarithmic Dynamic Cell-Probe Lower Bounds
par: Ko, Young Kun
Publié: (2025)

On the Parameterized Complexity of Semitotal Domination on Graph Classes
par: Retschmeier, Lukas
Publié: (2025)

Lower Bounds on Cardinality of Reducts for Decision Tables from Closed Classes
par: Ostonov, Azimkhon, et autres
Publié: (2024)

From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting
par: Hecher, Markus, et autres
Publié: (2025)

The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
par: Lauerbach, Antonio, et autres
Publié: (2024)

Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree
par: Liu, Brian, et autres
Publié: (2024)

On Formally Undecidable Propositions of Nondeterministic Complexity and Related Classes
par: Kolář, Martin
Publié: (2026)

Low-Degree Method Fails to Predict Robust Subspace Recovery
par: Jia, He, et autres
Publié: (2026)

Graph Homomorphism, Monotone Classes and Bounded Pathwidth
par: Eagling-Vose, Tala, et autres
Publié: (2024)

The Complexity of Finding and Counting Subtournaments
par: Döring, Simon, et autres
Publié: (2025)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
par: Bhargav, C. S., et autres
Publié: (2025)

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
par: Komarath, Balagopal, et autres
Publié: (2025)

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
par: Pratt-Hartmann, Ian
Publié: (2006)

Tight Streaming Lower Bounds for Deterministic Approximate Counting
par: Wang, Yichuan
Publié: (2024)

The Complexity of Counting Small Sub-Hypergraphs
par: Bressan, Marco, et autres
Publié: (2025)

The Complexity Classes of Hamming Distance Recoverable Robust Problems
par: Grüne, Christoph
Publié: (2022)

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
par: Yamakami, Tomoyuki
Publié: (2025)

New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
par: Chen, Lijie, et autres
Publié: (2025)

A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence
par: Okada, Naoaki, et autres
Publié: (2024)

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
par: Döring, Simon, et autres
Publié: (2024)

Results on Logarithmic Coefficients for the Class of Bounded Turning Functions
par: Mandal, Sanju, et autres
Publié: (2025)

The Counting General Dominating Set Framework
par: Zheng, Jiayi, et autres
Publié: (2026)

Epistemic Logic Programs: Non-Ground and Counting Complexity
par: Eiter, Thomas, et autres
Publié: (2025)

Efficient Matrix Product State Learning in Logarithmic Depth
par: Lin, Chia-Ying, et autres
Publié: (2025)

The Structure of In-Place Space-Bounded Computation
par: Cook, James, et autres
Publié: (2025)

Improved Space Bounds for Subset Sum
par: Belova, Tatiana, et autres
Publié: (2024)

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
par: Baril, Ambroise, et autres
Publié: (2025)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
par: Yamakami, Tomoyuki
Publié: (2024)