Boolean Functions and Computation Models (Hardcover, 2002 ed.)

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 undergraduates and graduate students as well as researchers in the field of complexity theory.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Texts in Theoretical Computer Science. An EATCS Series
Release date:	September 2002
First published:	September 2002
Authors:	Peter Clote • Evangelos Kranakis
Dimensions:	235 x 155 x 29mm (L x W x T)
Format:	Hardcover
Pages:	602
Edition:	2002 ed.
ISBN-13:	978-3-540-59436-9
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > Computer programming > General Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > Parallel processing
LSN:	3-540-59436-1
Barcode:	9783540594369

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!