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

Meinel, Christoph

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

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2008
Idioma
Inglés
ISBN 10 
354051340X
ISBN 13 
9783540513407
Encuadernación
Tapa blanda
Número de páginas
144
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

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

Edición Destacada

ISBN 10:  038751340X ISBN 13:  9780387513409
Editorial: Springer Verlag, 1989
Tapa blanda