Artículos relacionados a Modified Branching Programs and Their Computational...
Modified Branching Programs and Their Computational Power: 370 (Lecture Notes in Computer Science) - Tapa blanda
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.
Comprar nuevo
Ver este artículo
EUR 58,56
EUR 5,15 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Modified Branching Programs and Their Computational...
Imagen del vendedor
Modified branching programs and their computational power. Lecture notes in computer science ; 370
Publicado por
Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong : Springer, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Antiguo o usado
Tapa blanda
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Calificación del vendedor: 5 de 5 estrellas
VI, 132 pages Ex-Library book in good condition. 9783540513407 Sprache: Englisch Gewicht in Gramm: 440. Nº de ref. del artículo: 1166259
Cantidad disponible: 1 disponibles
Imagen de archivo
Modified Branching Programs and Their Computational Power
Publicado por
Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Antiguo o usado
Tapa blanda
Librería: Better World Books Ltd, Dunfermline, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Very Good. Ships from the UK. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. Nº de ref. del artículo: 50372778-20
Cantidad disponible: 1 disponibles
Imagen de archivo
Modified Branching Programs and Their Computational Power
Publicado por
Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Antiguo o usado
Tapa blanda
Librería: Better World Books: West, Reno, NV, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Very Good. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. Nº de ref. del artículo: 50372778-20
Cantidad disponible: 1 disponibles
Imagen de archivo
Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science, 370)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540513407_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Modified Branching Programs and Their Computational Power
Publicado por
Springer Berlin Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783540513407
Cantidad disponible: 1 disponibles
Imagen del vendedor
Modified Branching Programs and Their Computational Power
Publicado por
Springer Berlin Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 defin. Nº de ref. del artículo: 4891925
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Modified Branching Programs and Their Computational Power
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540513407
Cantidad disponible: 10 disponibles
Imagen del vendedor
Modified Branching Programs and Their Computational Power
Publicado por
Springer Berlin Heidelberg Jul 1989, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 144 pp. Englisch. Nº de ref. del artículo: 9783540513407
Cantidad disponible: 2 disponibles
Imagen de archivo
Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science)
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Very Good. 038751340X Ex-library paperback in very nice condition with the usual markings and attachments. Nº de ref. del artículo: UTD14a2591
Cantidad disponible: 1 disponibles
Imagen del vendedor
Modified Branching Programs and Their Computational Power
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1989, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 144 pp. Englisch. Nº de ref. del artículo: 9783540513407
Cantidad disponible: 1 disponibles