Abstract
Due to certain branching program based characterizations of the nonuniform complexity classes
we prove the p-projection completeness of a number of extremely restricted modifications of the GRAPH-ACCESSIBILITY-PROBLEMS for switching graphs.
Preview
Unable to display preview. Download preview PDF.
References
Barrington, D.A., Bounded width polynomial size branching programs recognizing exactly those languages in NC1, Proc. 18th STOC 1986, 1–5.
Bucach, L., Klassifizierungsprobleme und das Verhältnis von deterministischer und nichtdeterministischer Raumkomplexität, Sem. Ber. 68 (1985), Humboldtät Univ. Berlin.
Cobham, A., The recognition problem for the set of perfect squares, Research paper RC-1704, IBM Watson Research Centre, 1966.
Chandra, A.K., Stockmeyer, L. and Vishkin, U., Constant depth reducibility, SIAM J. Comput. 13, 2 (1984), 423–439.
Immerman, N., Nondeterministic space is closed under complement, Techn. Report 552, Yale Univ., 1987
Karp, R.M. and Lipton, R.J., Some connections between nonuniform and uniform complexity classes, Proc. 12th STOC 1980, 302–309.
Meinel, Ch., P-projection reducibility and the complexity classes L(nonuniform) and NL(nonuniform). Proc. 12th MFCS (Bratislava) 1986, LNCS 233, 527–535.
Meinel, Ch., The power of nondeterminism in polynomial size bounded width branching programs. Proc. FCT 87 (Kasan), LNCS278, 302–309; also in TCS 62 (1988), 319–325.
Meinel, Ch., The power of polynomial size Ω-branching programs, Proc. STACS '88 (Bordeaux), LNCS 294,81–90.
Meinel, Ch., Modified branching programs and their computational power, Diss. B, Berlin, 1988; to appear as LNCS.
Pudlak, P. and Zak, S., Space complexity of computations, Preprint Univ. Of Prague, 1983.
Savitch, W., Maze recognizing automata and nondeterministic tape complexity, JCSS Vol. 7, 1973, 389–403.
Skyum, S. and Valiant, L.G., A complexity theory based on Boolean algebra, Proc. 22th FOCS 1981, 244–253.
Szelepcsenyi: The method of forcing for nondeterministic automata, Bull. of the EATCS 33, 96–99
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meinel, C. (1989). Switching graphs and their complexity. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_82
Download citation
DOI: https://doi.org/10.1007/3-540-51486-4_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51486-2
Online ISBN: 978-3-540-48176-8
eBook Packages: Springer Book Archive