Sold Out
Sold Out
Book Categories |
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.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionModified Branching Programs and Their Computational Power
X
This Item is in Your InventoryModified Branching Programs and Their Computational Power
X
You must be logged in to review the productsX
X
X
Add Modified Branching Programs and Their Computational Power, , Modified Branching Programs and Their Computational Power to the inventory that you are selling on WonderClubX
X
Add Modified Branching Programs and Their Computational Power, , Modified Branching Programs and Their Computational Power to your collection on WonderClub |