Modified Branching Programs and Their Computational Power

Meinel, Christoph

ISBN 10: 354051340X / ISBN 13: 9783540513407

Editore: Springer Berlin / Heidelberg, 1989

Riguardo questo articolo

Ships from the UK. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. Codice articolo 50372778-20

Dati bibliografici

Titolo: Modified Branching Programs and Their ...

Casa editrice: Springer Berlin / Heidelberg

Data di pubblicazione: 1989

Legatura: Brossura

Condizione: Very Good

Descrizione articolo

Riassunto:

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.

Contenuti:

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