Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science, 370)
Meinel, Christoph
ISBN 10: 354051340X ISBN 13: 9783540513407
Verlag: Springer, 1989
Neu
Softcover
Verkäufer
Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 25. März 2015
Dieser Artikel ist nicht mehr verfügbar.
Beschreibung
Beschreibung:
In. Bestandsnummer des Verkäufers ria9783540513407_new
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.
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.
Bibliografische Details
Titel: Modified Branching Programs and Their ...
Verlag: Springer
Erscheinungsdatum: 1989
Einband: Softcover
Zustand: New
Beste Suchergebnisse beim ZVAB
Modified branching programs and their computational power. Lecture notes in computer science ; 370
ISBN 10: 354051340X
ISBN 13: 9783540513407
Gebraucht
Softcover
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
VI, 132 pages Ex-Library book in good condition. 9783540513407 Sprache: Englisch Gewicht in Gramm: 440. Artikel-Nr. 1166259
Gebraucht kaufen
EUR 4,00
EUR 16,00 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Modified Branching Programs and Their Computational Power
Verlag:
Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Gebraucht
Softcover
Anbieter: Better World Books Ltd, Dunfermline, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Artikel-Nr. 50372778-20
Gebraucht kaufen
EUR 12,01
EUR 9,11 shipping
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Modified Branching Programs and Their Computational Power
Verlag:
Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Gebraucht
Softcover
Anbieter: Better World Books: West, Reno, NV, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Artikel-Nr. 50372778-20
Gebraucht kaufen
EUR 22,38
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Modified Branching Programs and Their Computational Power
Anbieter: preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Modified Branching Programs and Their Computational Power | Christoph Meinel | Taschenbuch | vi | Englisch | 1989 | Springer | EAN 9783540513407 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Artikel-Nr. 102589297
Neu kaufen
EUR 50,35
EUR 70,00 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 5 verfügbar
Foto des Verkäufers
Modified Branching Programs and Their Computational Power
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Artikel-Nr. 9783540513407
Neu kaufen
EUR 53,49
EUR 61,15 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar