Matches in Harvard for { <http://id.lib.harvard.edu/aleph/001911586/catalog> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- catalog abstract ""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."--Publisher's website.".
- catalog contributor b2751033.
- catalog created "c1989.".
- catalog date "1989".
- catalog date "c1989.".
- catalog dateCopyrighted "c1989.".
- catalog description ""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."--Publisher's website.".
- catalog description "Bibliography: p. [127]-130.".
- catalog extent "vi, 132 p. ;".
- catalog hasFormat "Modified branching programs and their computational power.".
- catalog identifier "038751340X (U.S. : alk. paper)".
- catalog isFormatOf "Modified branching programs and their computational power.".
- catalog isPartOf "Lecture notes in computer science ; 370".
- catalog issued "1989".
- catalog issued "c1989.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer-Verlag,".
- catalog relation "Modified branching programs and their computational power.".
- catalog subject "519.2/34 20".
- catalog subject "Branching processes.".
- catalog subject "Computational complexity.".
- catalog subject "QA274.76 .M45 1989".
- catalog title "Modified branching programs and their computational power / Christoph Meinel.".
- catalog type "text".