Christoph Meinel
Modified Branching Programs and Their Computational Power - Lecture Notes in Computer Science Christoph Meinel 1989 edition

Name: Modified Branching Programs and Their Computational Power - Lecture Notes in Computer Science
Price: 446 CNY
Availability: OutOfStock
Author: Christoph Meinel

价格

元 446

不含税

远程仓调货

预计送达时间年7月13日 - 年7月29日

顾客评价：

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

根据欧洲消费者保护法享受14天退换货政策

Trustpilot平台高分认证

添加至iMusic心愿单

Not rated yet

Modified Branching Programs and Their Computational Power - Lecture Notes in Computer Science

Christoph Meinel

1989 edition

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.

132 pages, biography

介质类型	图书 Paperback Book (平装胶订图书)
已发行	1989年7月12日
ISBN13	9783540513407
出版商	Springer-Verlag Berlin and Heidelberg Gm
页数	132
商品尺寸	155 × 235 × 7 mm · 213 g
语言	英语