Separating \oplus L from L, NL, co-NL, and AL = P for oblivious Turing machines of linear access
From MaRDI portal
Publication:4032302
DOI10.1051/ITA/1992260605071zbMATH Open0766.68042OpenAlexW178272701MaRDI QIDQ4032302FDOQ4032302
Authors: Matthias Krause 
Publication date: 1 April 1993
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92430
Recommendations
Cites Work
- On uniform circuit complexity
- Title not available (Why is that?)
- Nondeterministic Space is Closed under Complementation
- On the complexity of branching programs and decision trees for clique functions
- Title not available (Why is that?)
- On the power of parity polynomial time
- Title not available (Why is that?)
- Modified branching programs and their computational power
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
- Separating complexity classes related to bounded alternating ?-branching programs
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032302)
