Items related to Modified Branching Programs and Their Computational...
Modified Branching Programs and Their Computational Power: 370 (Lecture Notes in Computer Science, 370) - Softcover
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.
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date1989
- ISBN 10 354051340X
- ISBN 13 9783540513407
- BindingPaperback
- LanguageEnglish
- Number of pages138
Search results for Modified Branching Programs and Their Computational...
Seller Image
Modified branching programs and their computational power. Lecture notes in computer science ; 370
ISBN 10: 354051340X
ISBN 13: 9783540513407
Used
Softcover
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
VI, 132 pages Ex-Library book in good condition. 9783540513407 Sprache: Englisch Gewicht in Gramm: 440. Seller Inventory # 1166259
Quantity: 1 available
Stock Image
Modified Branching Programs and Their Computational Power
Published by
Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Used
Softcover
Seller: Better World Books: West, Reno, NV, U.S.A.
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 50372778-20
Quantity: 1 available
Stock Image
Modified Branching Programs and Their Computational Power
Published by
Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
Used
Softcover
Seller: Better World Books Ltd, Dunfermline, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 50372778-20
Quantity: 1 available
Stock Image
Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science, 370)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540513407_new
Quantity: Over 20 available
Stock Image
Modified Branching Programs and Their Computational Power
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540513407
Quantity: 10 available
Seller Image
Modified Branching Programs and Their Computational Power
Published by
Springer Berlin Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540513407
Quantity: 1 available
Seller Image
Modified Branching Programs and Their Computational Power
Published by
Springer Berlin Heidelberg, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4891925
Quantity: Over 20 available
Seller Image
Modified Branching Programs and Their Computational Power
Published by
Springer Berlin Heidelberg Jul 1989, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540513407
Quantity: 2 available
Stock Image
Modified Branching Programs and Their Computational Power (Lecture Notes in Computer Science)
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. 038751340X Ex-library paperback in very nice condition with the usual markings and attachments. Seller Inventory # UTD14a2591
Quantity: 1 available
Seller Image
Modified Branching Programs and Their Computational Power
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1989, 1989
ISBN 10: 354051340X
ISBN 13: 9783540513407
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540513407
Quantity: 1 available