Modified Branching Programs and Their Computational Power [electronic resource] /

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.

Bibliographic Details

Main Authors:	Meinel, Christoph. author., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1989
Subjects:	Mathematics., Computers., Algorithms., Probabilities., Combinatorics., Probability Theory and Stochastic Processes., Computation by Abstract Devices., Algorithm Analysis and Problem Complexity.,
Online Access:	http://dx.doi.org/10.1007/BFb0017563
Tags:	Add Tag No Tags, Be the first to tag this record!