Modified Branching Programs and Their Computational Power - Lecture Notes in Computer Science - Christoph Meinel - Bøker - Springer-Verlag Berlin and Heidelberg Gm - 9783540513407 - 12. juli 1989
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

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

Christoph Meinel

Pris
CA$ 76,99

Bestillingsvarer

Forventes levert 30. jul - 7. aug
Legg til iMusic ønskeliste
Eller

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

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

Media Bøker     Pocketbok   (Bok med mykt omslag og limt rygg)
Utgitt 12. juli 1989
ISBN13 9783540513407
Utgivere Springer-Verlag Berlin and Heidelberg Gm
Antall sider 132
Mål 155 × 235 × 7 mm   ·   213 g
Språk Engelsk  

Vis alle

Mer med Christoph Meinel