IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-0897-3_20.html
   My bibliography  Save this book chapter

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

In: Mathematical Logic and Its Applications

Author

Listed:
  • Christoph Meinel

    (Humboldt-Universität, Sektion Mathematik)

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.

Suggested Citation

  • Christoph Meinel, 1987. "Projection Complete Graph Problems Corresponding to a Branching-Program-Based Characterization of the Complexity Classes NC 1 ,Land NL," Springer Books, in: Dimiter G. Skordev (ed.), Mathematical Logic and Its Applications, pages 283-292, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-0897-3_20
    DOI: 10.1007/978-1-4613-0897-3_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4613-0897-3_20. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.