On Oblivious Branching Programs of Linear Length

Abstract Input oblivious decision graphs of linear length are considered. Among other concerns the computational complexity of three graph accessibility problems and the word problem of the free group are investigated. Several exponential lower bounds are proved.

[1]  Christoph Meinel,et al.  Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe , 1988, International Symposium on Mathematical Foundations of Computer Science.

[2]  Richard J. Lipton,et al.  Word Problems Solvable in Logspace , 1977, JACM.

[3]  Stephan Waack,et al.  Lower Bounds on The Complexity of Real-Time Branching Programs , 1988, RAIRO Theor. Informatics Appl..

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

[5]  Allan Borodin,et al.  A time-space tradeoff for sorting on a general sequential model of computation , 1980, STOC '80.

[6]  Matthias Krause.  Lower Bounds for Depth-Restricted Branching Programs , 1991, Inf. Comput..

[7]  Ingo Wegener,et al.  On the complexity of branching programs and decision trees for clique functions , 1988, JACM.

[8]  C. Meinel.  The nonuniform complexity classes NC 1 , LN , 1987 .

[9]  Noga Alon,et al.  Meanders, Ramsey theory and lower bounds for branching programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  Stanislav Zák,et al.  An Exponential Lower Bound for One-Time-Only Branching Programs , 1984, MFCS.

[11]  Vojtech Rödl,et al.  Two lower bounds for branching programs , 1986, STOC '86.

[12]  Matthias Krause,et al.  Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs , 1988, Journal of Information Processing and Cybernetics.

[13]  Wilhelm Magnus,et al.  Über diskontinuierliche Gruppen mit einer definierenden Relation. (Der Freiheitssatz). , 1930 .

[14]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[15]  W. Magnus.  Das Identitätsproblem für Gruppen mit einer definierenden Relation , 1932 .