Contact
How to shop
Delivery
Shopping guide
Modified Branching Programs and Their Computational Power
English
148 b
Up to 30 days for returns
Customers also purchased
/
Paperback
10.89
€
21.29 лв
/
Paperback
14.83
€
29.01 лв
/
Paperback
19.34
€
37.83 лв
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
18.10
€
35.40 лв
/
Paperback
54.56
€
106.72 лв
/
Paperback
10.32
€
20.18 лв
Hi! I'm Libroamiko, your book advisor.
How can I help you?