Trending Bestseller

Modified Branching Programs and Their Computational Power

Christoph Meinel

No reviews yet Write a Review
Paperback / softback
12 July 1989
$122.00
Ships in 3-5 business days
Hurry up! Current stock:
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.

This product hasn't received any reviews yet. Be the first to review this product!

$122.00
Ships in 3-5 business days
Hurry up! Current stock:

Modified Branching Programs and Their Computational Power

$122.00

Description

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.

Customers Also Viewed

Buy Books Online at BookLoop

Discover your next great read at BookLoop, Australiand online bookstore offering a vast selection of titles across various genres and interests. Whether you're curious about what's trending or searching for graphic novels that captivate, thrilling crime and mystery fiction, or exhilarating action and adventure stories, our curated collections have something for every reader. Delve into imaginative fantasy worlds or explore the realms of science fiction that challenge the boundaries of reality. Fans of contemporary narratives will find compelling stories in our contemporary fiction section. Embark on epic journeys with our fantasy and science fiction titles,

Shop Trending Books and New Releases

Explore our new releases for the most recent additions in romance books, fantasy books, graphic novels, crime and mystery books, science fiction books as well as biographies, cookbooks, self help books, tarot cards, fortunetelling and much more. With titles covering current trends, booktok and bookstagram recommendations, and emerging authors, BookLoop remains your go-to local australian bookstore for buying books online across all book genres.

Shop Best Books By Collection

Stay updated with the literary world by browsing our trending books, featuring the latest bestsellers and critically acclaimed works. Explore titles from popular brands like Minecraft, Pokemon, Star Wars, Bluey, Lonely Planet, ABIA award winners, Peppa Pig, and our specialised collection of ADHD books. At BookLoop, we are committed to providing a diverse and enriching reading experience for all.