Modified Branching Programs and Their Computational Power
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 ar…
Mehr
CHF 86.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V103:
Folgt in ca. 5 Arbeitstagen
Produktdetails
- ISBN: 978-3-540-51340-7
- EAN: 9783540513407
- Produktnummer: 3246679
- Verlag: Springer Berlin Heidelberg
- Sprache: Englisch
- Erscheinungsjahr: 1989
- Seitenangabe: 144 S.
- Masse: H24.2 cm x B16.6 cm x D1.0 cm 270 g
- Auflage: 1989
- Abbildungen: Paperback
- Gewicht: 270
86 weitere Werke von Christoph Meinel:
Bewertungen
Anmelden