Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
- 7 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 240-249
- https://doi.org/10.1109/sct.1989.41831
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- The power of polynomial size Ω-branching programsPublished by Springer Nature ,2006
- Lower bounds for depth-restricted branching programsInformation and Computation, 1991
- The method of forced enumeration for nondeterministic automataActa Informatica, 1988
- Meanders, Ramsey theory and lower bounds for branching programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A complexity theory based on Boolean algebraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Some connections between nonuniform and uniform complexity classesPublished by Association for Computing Machinery (ACM) ,1980