Boolean Functions and Computation Models
Buch in deiner Nähe kaufen
Beschreibung
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.
This advanced textbook surveys research on boolean functions, circuits, parallel computation models, function algebras, and proof systems, with an overriding focus on the structure of "fast" parallel computation.
A survey of the present state of the art by internationally well-known authors Focus on "fast" parallel computation Includes numerous exercises ranging in difficulty Includes supplementary material: sn.pub/extras
Autor*in
Peter Clote
Themen in »Boolean Functions and Computation Models«
Beweissysteme Boolean function Boolesche Funktionen Erfüllbarkeitsproblem der Aussagenlogik Komplexitätstheorie Paralleles Rechnen combinatorics complexity complexity theory proof theory
Stimmen zu »Boolean Functions and Computation Models«
From the reviews:
"The monograph gives the most recent and complete description of lower bounds for depth-restricted circuits, and propositional proof systems. … the authors present a research monograph on important subjects and provide many very recent results. I would recommend it for any university library and also for researchers." (Ingo Wegener, The Computer Journal, Vol. 46 (3), 2003)
()