Modified Branching Programs and Their Computational Power [electronic resource] / by Christoph Meinel.

By: Meinel, Christoph [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 370Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1989Description: VI, 132 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540461982Subject(s): Computer science | Computer software | Combinatorics | Computer Science | Computation by Abstract Devices | Algorithm Analysis and Problem Complexity | CombinatoricsAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access online
Contents:
Preliminaries -- Branching programs and their computational power -- Nondeterministic branching programs -- ?=branching programs and theirs computational power.
In: Springer eBooksSummary: Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a definition of branching programs and a review of the former research, nondeterministic branching programs are introduced and investigated, thus allowing the description of some fundamental complexity classes. The book then concentrates on the new concept of Omega-branching programs. Apart from the usual binary tests they contain features for evaluating certain elementary Boolean functions and are suited for characterizing space-bounded complexity classes. By means of these characterizations the author demonstrates the separation of some restricted complexity classes. In the appendix a number of extremely restricted graph-accessibility problems are given, which are, due to the branching program descriptions in chapters 1-3, p-projection complete in the classes under consideration.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

Preliminaries -- Branching programs and their computational power -- Nondeterministic branching programs -- ?=branching programs and theirs computational power.

Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a definition of branching programs and a review of the former research, nondeterministic branching programs are introduced and investigated, thus allowing the description of some fundamental complexity classes. The book then concentrates on the new concept of Omega-branching programs. Apart from the usual binary tests they contain features for evaluating certain elementary Boolean functions and are suited for characterizing space-bounded complexity classes. By means of these characterizations the author demonstrates the separation of some restricted complexity classes. In the appendix a number of extremely restricted graph-accessibility problems are given, which are, due to the branching program descriptions in chapters 1-3, p-projection complete in the classes under consideration.

There are no comments on this title.

to post a comment.


Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha