Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series) - Hardcover

Clote, Peter; Kranakis, Evangelos

Hardcover

ISBN 10: 3540594361 ISBN 13: 9783540594369

Verlag: Springer, 2002

Inhaltsangabe

The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform 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. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers.

Über diesen Titel

Von der hinteren Coverseite

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.

Details zur Ausgabe

• Verlag: Springer
• Erscheinungsdatum: 2002
• ISBN 10: 3540594361
• ISBN 13: 9783540594369
• Einband: Tapa dura
• Sprache: Englisch
• Anzahl der Seiten: 620