|
|
|||
|
||||
OverviewBranching 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. Full Product DetailsAuthor: Christoph MeinelPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 1989 ed. Volume: 370 Dimensions: Width: 15.50cm , Height: 0.70cm , Length: 23.50cm Weight: 0.470kg ISBN: 9783540513407ISBN 10: 354051340 Pages: 132 Publication Date: 12 July 1989 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsPreliminaries.- Branching programs and their computational power.- Nondeterministic branching programs.- ?=branching programs and theirs computational power.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |