Modified Branching Programs and Their Computational Power - Lecture Notes in Computer Science - Christoph Meinel - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540513407 - 1989. gada 12. jūlijs
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

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

Cena
€ 64,49

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 14. - 28. jūl.
Pievienot savam iMusic vēlmju sarakstam

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 1989. gada 12. jūlijs
ISBN13 9783540513407
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 132
Izmēri 155 × 235 × 7 mm   ·   213 g
Valoda Angļu  

Vairāk no Christoph Meinel

Rādīt visu

Mere med samme udgiver