Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access
RAIRO-Theor. Inf. Appl., 26 6 (1992) 507-522
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Beate Bollig, Stephan Waack and Philipp WoelfelTheoretical Computer Science 362 (1-3) 86 (2006)
https://doi.org/10.1016/j.tcs.2006.05.035
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs
Beate Bollig, Martin Sauerhoff and Ingo WegenerInformation and Computation 178 (1) 263 (2002)
https://doi.org/10.1006/inco.2002.3174
Foundations of Information Technology in the Era of Network and Mobile Computing
Beate Bollig, Stephan Waack and Philipp WoelfelFoundations of Information Technology in the Era of Network and Mobile Computing 83 (2002)
https://doi.org/10.1007/978-0-387-35608-2_8
172 (2000)
https://doi.org/10.1109/CCC.2001.933884
Numbers, Information and Complexity
Ingo WegenerNumbers, Information and Complexity 615 (2000)
https://doi.org/10.1007/978-1-4757-6048-4_49