Switching Graphs and Their Complexity

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.

[1]  Christoph Meinel.  The Power of Nondeterminism in Polynominal-size Bounded-width Branching Programs , 1987, FCT.

[2]  Christoph Meinel,et al.  Modified Branching Programs and Their Computational Power , 1989, Lecture Notes in Computer Science.

[3]  Christoph Meinel.  The Power of Polynomial Size Omega-Branching Programs , 1988, STACS.

[4]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[5]  Róbert Szelepcsényi.  The moethod of focing for nondeterministic automata , 1987, Bull. EATCS.

[6]  Christoph Meinel.  The Power of Nondeterminism in Polynomial-Size Bounded-Width Branching Programs , 1988, Theor. Comput. Sci..

[7]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[8]  Neil Immerman,et al.  Nondeterministic space is closed under complementation , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[9]  Alan Cobham,et al.  The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.

[10]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[11]  Walter J. Savitch,et al.  Maze Recognizing Automata and Nondeterministic Tape Complexity , 1973, J. Comput. Syst. Sci..

[12]  Christoph Meinel,et al.  p-Projection Reducibility and the Complexity Classes L(nonuniform) and NL(nonuniform) , 1996, MFCS.

[13]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.