Condizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 58,82
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Condizione: New.
Da: Chiron Media, Wallingford, Regno Unito
EUR 56,51
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Lingua: Inglese
Editore: Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong : Springer, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Da: Antiquariat Bookfarm, Löbnitz, Germania
EUR 56,47
Quantità: 1 disponibili
Aggiungi al carrelloVI, 132 pages Ex-Library book in good condition. 9783540513407 Sprache: Englisch Gewicht in Gramm: 440.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Da: moluna, Greven, Germania
EUR 64,08
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 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.
Lingua: Inglese
Editore: Springer, Berlin, Springer, 1989
ISBN 10: 354051340X ISBN 13: 9783540513407
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 77,74
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. 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.