Articles liés à Modified Branching Programs and Their Computational...
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer
- Date d'édition2008
- ISBN 10 354051340X
- ISBN 13 9783540513407
- ReliureBroché
- Langueanglais
- Nombre de pages144
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 48,37
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Modified Branching Programs and Their Computational...
Image fournie par le vendeur
Modified branching programs and their computational power. Lecture notes in computer science ; 370
ISBN 10 : 354051340X
ISBN 13 : 9783540513407
Ancien ou d'occasion
Couverture souple
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
VI, 132 pages Ex-Library book in good condition. 9783540513407 Sprache: Englisch Gewicht in Gramm: 440. N° de réf. du vendeur 1166259
Quantité disponible : 1 disponible(s)
Image d'archives
Modified Branching Programs and Their Computational Power
Edité par
Springer Berlin / Heidelberg, 1989
ISBN 10 : 354051340X
ISBN 13 : 9783540513407
Ancien ou d'occasion
Couverture souple
Vendeur : Better World Books: West, Reno, NV, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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 réf. du vendeur 50372778-20
Quantité disponible : 1 disponible(s)
Image d'archives
Modified Branching Programs and Their Computational Power
Edité par
Springer Berlin / Heidelberg, 1989
ISBN 10 : 354051340X
ISBN 13 : 9783540513407
Ancien ou d'occasion
Couverture souple
Vendeur : Better World Books Ltd, Dunfermline, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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 réf. du vendeur 50372778-20
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Modified Branching Programs and Their Computational Power
Edité par
Springer Berlin Heidelberg, 1989
ISBN 10 : 354051340X
ISBN 13 : 9783540513407
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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 réf. du vendeur 4891925
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Modified Branching Programs and Their Computational Power
Edité par
Springer Berlin Heidelberg, 1989
ISBN 10 : 354051340X
ISBN 13 : 9783540513407
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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 réf. du vendeur 9783540513407
Quantité disponible : 1 disponible(s)
Image d'archives
Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science, 370)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540513407_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Modified Branching Programs and Their Computational Power
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1989, 1989
ISBN 10 : 354051340X
ISBN 13 : 9783540513407
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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 réf. du vendeur 9783540513407
Quantité disponible : 1 disponible(s)
Image d'archives
Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science)
Edité par
Springer, 1989
ISBN 10 : 354051340X
ISBN 13 : 9783540513407
Ancien ou d'occasion
Paperback
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Very Good. 038751340X Ex-library paperback in very nice condition with the usual markings and attachments. N° de réf. du vendeur UTD14a2591
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Modified Branching Programs and Their Computational Power
Edité par
Springer Berlin Heidelberg Jul 1989, 1989
ISBN 10 : 354051340X
ISBN 13 : 9783540513407
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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 réf. du vendeur 9783540513407
Quantité disponible : 2 disponible(s)
Image d'archives
Modified Branching Programs and Their Computational Power
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540513407
Quantité disponible : 10 disponible(s)