Item description for Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science) by Christoph Meinel...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.3" Width: 6.3" Height: 0.4" Weight: 0.55 lbs.
Release Date Aug 9, 1989
ISBN 354051340X ISBN13 9783540513407
Availability 145 units. Availability accurate as of Jan 19, 2017 02:14.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
More About Christoph Meinel
Meninel, University of Trier, Germany.
Christoph Meinel was born in 1954 and has an academic affiliation as follows - Hasso-Plattner-Institute for IT Systems Engineering, University of Pot.