Boolean Functions and Computation Models
By: by Peter Clote, Evangelos Kranakis
Contributors: Kranakis, Evangelos
Series: Texts in Theoretical Computer Science. An EATCS Series; Texts in Theoretical Computer Science. An EATCS Series
Publisher: Springer Berlin Heidelberg
Published: 2002
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 602
ISBN-13: 9783642082177; 9783662049433
Subjects: Symbolic and mathematical Logic; Computer science
Description: 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.