Boolean.Functions.and.Computation.Models,.Clote,.Kranakis,.Sprin...
This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits, uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. The book will benefit advanced undergraduate and graduate students as well as researchers in the field of complexity theory. Content Level » Research Keywords » Beweissysteme - Boolesche Funktionen - Komplexitätstheorie - Paralleles Rechnen Related subjects » Mathematics - Software Engineering - Theoretical Computer Science
- 粉丝: 587
- 资源: 38
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助