Modified Branching Programs and Their Computational Power - Lecture Notes in Computer Science - Christoph Meinel - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783540513407 - 12. julija 1989
Če se naslovnica in naslov ne ujemata, je naslov pravilen

Modified Branching Programs and Their Computational Power - Lecture Notes in Computer Science 1989 edition

Cena
€ 59,99

Naročeno iz oddaljenega skladišča

Predvidena dobava 24. avg - 7. sep
Prejemajte obvestila o novih izdajah izvajalca Christoph Meinel
Dodaj na svoj seznam želja iMusic

Not rated yet

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.


132 pages, biography

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 12. julija 1989
ISBN13 9783540513407
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 132
Dimenzije 155 × 235 × 7 mm   ·   213 g
Jezik Angleščina  

Več od Christoph Meinel

Prikaži vse

Več od istega **izdajatelja**