Modified Branching Programs and Their Computational Power: 370 (Lecture Notes in Computer Science, 370) - Softcover

Meinel, Christoph

 
9783540513407: Modified Branching Programs and Their Computational Power: 370 (Lecture Notes in Computer Science, 370)
Softcover
ISBN 10: 354051340X ISBN 13: 9783540513407
Verlag: Springer, 2008

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2008
Sprache
Englisch
ISBN 10 
354051340X
ISBN 13 
9783540513407
Einband
Tapa blanda
Anzahl der Seiten
144
Kontakt zum Hersteller
ProductSafety@springernature.com
ProductSafety@springernature.com

Tiergartenstr. 17
Heidelberg
69121
Deutschland

Weitere beliebte Ausgaben desselben Titels

9780387513409: Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science)

Vorgestellte Ausgabe

ISBN 10:  038751340X ISBN 13:  9780387513409
Verlag: Springer Verlag, 1989
Softcover