Separating complexity classes related to bounded alternating ?-branching programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4051004
- Polynomial size \(\Omega\)-branching programs and their computational power
- Separating \oplus L from L, NL, co-NL, and AL = P for oblivious Turing machines of linear access
- scientific article; zbMATH DE number 176154
- scientific article; zbMATH DE number 4213443
Cites work
- scientific article; zbMATH DE number 176154 (Why is no real title available?)
- scientific article; zbMATH DE number 827986 (Why is no real title available?)
- Meanders and their applications in lower bounds arguments
- On the complexity of branching programs and decision trees for clique functions
- Relationships between nondeterministic and deterministic tape complexities
- Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
- Structure and importance of logspace-MOD class
Cited in
(7)- scientific article; zbMATH DE number 4213443 (Why is no real title available?)
- scientific article; zbMATH DE number 4051004 (Why is no real title available?)
- scientific article; zbMATH DE number 36617 (Why is no real title available?)
- Separating \oplus L from L, NL, co-NL, and AL = P for oblivious Turing machines of linear access
- scientific article; zbMATH DE number 176154 (Why is no real title available?)
- scientific article; zbMATH DE number 512807 (Why is no real title available?)
- Polynomial size \(\Omega\)-branching programs and their computational power
This page was built for publication: Separating complexity classes related to bounded alternating ?-branching programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327378)
