Projection Complete Graph Problems Corresponding to a Branching-Program-Based Characterization of the Complexity Classes NC 1,Land NL

Christoph Meinel
Additional contact information
Christoph Meinel: Humboldt-Universität, Sektion Mathematik

A chapter in Mathematical Logic and Its Applications, 1987, pp 283-292 from Springer

Abstract: Abstract 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.

Keywords: Boolean Function; Turing Machine; Complexity Class; Boolean Variable; Bounded Width (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_20

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().