A note on closure properties of logspace MOD classes

DOI10.1016/S0020-0190(00)00091-0zbMath0953.68549OpenAlexW1987386540MaRDI QIDQ1583060

Steffen Reith, Ulrich Hertrampf, Heribert Vollmer

Publication date: 26 October 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00091-0

zbMATH Keywords

computational complexityclosure propertiescounting classeslogarithmic space bound

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

The complexity of intersecting finite automata having few final states ⋮ RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC! ⋮ Unnamed Item

Cites Work

• Space-bounded hierarchies and probabilistic computations
• The method of forced enumeration for nondeterministic automata
• The complexity of matrix rank and feasible systems of linear equations
• Nondeterministic Space is Closed under Complementation
• Structure and importance of logspace-MOD class
• The PL Hierarchy Collapses
• Adaptive logspace reducibility and parallel time
• Relationships among $PL$, $\#L$, and the determinant

This page was built for publication: A note on closure properties of logspace MOD classes