Modified Branching Programs and Their Computational Power
15 Angebote vergleichen

Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Versandkosten nach: DEU.
Von Händler/Antiquariat, Anybook Ltd.
Springer-Verlag, 1989. Volume 370. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,350grams, ISBN:038751340X.

Lieferung aus: Vereinigte Staaten von Amerika, Versandkostenfrei nach: USA.
Von Händler/Antiquariat, Better World Books.
Springer-Verlag. Used - Good. Ships from Reno, NV. Former Library book. Shows some signs of wear, and may have some markings on the inside. 100% Money Back Guarantee. Shipped to over one million happy customers. Your purchase benefits world literacy!

Lieferung aus: Österreich, Versandfertig in 7 - 9 Tagen.
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. Taschenbuch, 12.07.1989.

Lieferung aus: Vereinigte Staaten von Amerika, Versandkostenfrei.
Von Händler/Antiquariat, Better World Books: West [4720790], Reno, NV, U.S.A.
Ships from Reno, NV. Former Library book. Shows some signs of wear, and may have some markings on the inside.

Lieferung aus: Deutschland, Lagernd.
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. Soft cover.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, Better World Books: West.
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. Paperback, Label: Springer-Verlag, Springer-Verlag, Produktgruppe: Book, Publiziert: 1989-08, Studio: Springer-Verlag, Verkaufsrang: 17265436.

Lieferung aus: Vereinigte Staaten von Amerika, Frais de port à: FRA.
Von Händler/Antiquariat, GuthrieBooks.
Springer, 1989-08-09. Paperback. Very Good. 038751340X Ex-library paperback in very nice condition with the usual markings and attachments.

Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: DEU.
Von Händler/Antiquariat, GuthrieBooks.
Springer, 1989-08-09. Paperback. Very Good. 038751340X Ex-library paperback in very nice condition with the usual markings and attachments.

Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: USA.
Von Händler/Antiquariat, GuthrieBooks.
Springer-Verlag, 1989-08-01. Paperback. Very Good. 354051340X Ex-library paperback in very nice condition with the usual markings and attachments.

Lieferung aus: Vereinigte Staaten von Amerika, Versandkosten nach: USA.
Von Händler/Antiquariat, Ergodebooks.
Springer-Verlag, 1989-08-01. Paperback. Used:Good. Buy with confidence. Excellent Customer Service & Return policy. Ships Fast. 24*7 Customer Service.