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. Now you can buy Books online in USA,UK, India and more than 100 countries.
*Terms and Conditions apply
Disclaimer: All product data on this page belongs to . No
guarantees are made as to accuracy of prices and information.
How to buy a book?
Search for a specific Title OR Author Or ISBN
You can search by Title of Book(Partial names allowed).
You can search by Author of Book (Partial names allowed).
You can search by Subject e.g. Physics,chemistry (Partial names allowed).
You can search by ISBN e.g. 10 digits or 13 digits ISBN or asin of Book without any spaces or hyphens.
Shipping of Books is available all over the world with few exceptions.
Buying process is 100% secure.
Visitors Online
Contact Us
Create a Bookshelf of your Favorite books For Any Queries please don't hesitate to contact us at USA +1(760)3380762
+1(650) 9808080
India +91 9023011224
India +91 9023011224 (Whatsapp)
Buy Books online because as an Amazon Associate we earn from qualifying purchases.