Editore: Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong : Springer, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Lingua: Inglese
Da: Antiquariat Bookfarm, Löbnitz, Germania
VI, 132 pages Ex-Library book in good condition. 9783540513407 Sprache: Englisch Gewicht in Gramm: 440.
Editore: Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Lingua: Inglese
Da: Better World Books: West, Reno, NV, U.S.A.
EUR 23,77
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
Editore: Springer Berlin / Heidelberg, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Lingua: Inglese
Da: Better World Books Ltd, Dunfermline, Regno Unito
EUR 38,21
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
Editore: Springer Berlin Heidelberg, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,13
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
EUR 16,62
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Very Good. 038751340X Ex-library paperback in very nice condition with the usual markings and attachments.
Da: Chiron Media, Wallingford, Regno Unito
EUR 65,75
Convertire valutaQuantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 52,94
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Editore: Springer Berlin Heidelberg, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Lingua: Inglese
Da: moluna, Greven, Germania
EUR 48,37
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1989, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Editore: Springer Berlin Heidelberg Jul 1989, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Lingua: Inglese
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 64,19
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.