Projection Complete Graph Problems Corresponding to a Branching-Program-Based Characterization of the Complexity Classes NC1 ,Land NL
The p-projection completeness of some restricted graph accessibility problems for the (nonuniform) complexity classes NC 1 L and NL will be proved by means of branching-program-based characterizations of these classes. A simulation result concerning polynomial-size, bounded-width disjunctive branching programs and polynomial-size, bounded-width usual ones yields that NC 1=L implies L=NL. Some consequences of these results for separating these classes are discussed.
KeywordsBoolean Function Turing Machine Complexity Class Boolean Variable Bounded Width
Unable to display preview. Download preview PDF.
- /Ba86/.D.A.Barrington, ‘Bounded width polynomial-size branching programs recognizing exactly those languages in NC1, Proc. 18-th STOC, 1986, 1–5Google Scholar
- /FSS81/.M.Furst, J.B.Saxe, M.Sipser, ‘Parity, circuits and the polynomial-time hierarchy’, Proc. 22-th FOCS, 1981, 260–270Google Scholar
- /KL80/.R.M.Karp, R.J.Lipton, ‘Some connections between nonuniform and uniform complexity classes’, Proc. 12-th STOC, 1980, 302–309Google Scholar
- /Me86/.Ch.Meinel, ‘L (nonuniform) and NL (nonuniform)’, Proc. MFCS-86 (Bratislava), 1986Google Scholar
- /SV81/.S.Skyum, L.G.Valiant, ‘A complexity theory based on Boolean algebra’, Proc. 22-th FOCS, 1981, 244–253Google Scholar