Inductive counting below LOGSPACE
From MaRDI portal
Recommendations
- Inductive counting for width-restricted branching programs
- Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space
- Two Applications of Inductive Counting for Complementation Problems
- A variant of inductive counting
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results
Cites work
- A hierarchy that does not collapse : alternations in low level space
- Alternation
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- scientific article; zbMATH DE number 512811 (Why is no real title available?)
- scientific article; zbMATH DE number 3999297 (Why is no real title available?)
- Nondeterministic Space is Closed under Complementation
- The alternation hierarchy for sublogarithmic space is infinite
- The method of forced enumeration for nondeterministic automata
- Turing machines that take advice
- Two Applications of Inductive Counting for Complementation Problems
Cited in
(5)
This page was built for publication: Inductive counting below LOGSPACE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096885)