Boolean functions and computation models
- Responsibility
- Peter Clote, Evangelos Kranakis.
- Imprint
- Berlin ; New York : Springer, c2002.
- Physical description
- xiv, 601 p. : ill. ; 25 cm.
- Series
- Texts in theoretical computer science.
Available online
At the library
SAL3 (off-campus storage)
Stacks
Request (opens in new tab)
| Call number | Note | Status |
|---|---|---|
| QA267.7 .C58 2002 |
More options
Description
Creators/Contributors
- Author/Creator
- Clote, Peter.
- Contributor
- Kranakis, Evangelos.
Contents/Summary
- Bibliography
- Includes bibliographical references (p. [569]-590) and index.
- Contents
-
- 1. Boolean Functions
- 2. Circuit Lower Bounds
- Circuit Upper Bounds
- 4. Randomness and Satisfiability
- 5. Propositional Proof Systems
- 6. Machine Models and Function Algebras
- 7. Higher Types
- References.
- (source: Nielsen Book Data)
- Publisher's summary
-
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.
(source: Nielsen Book Data)
Subjects
Bibliographic information
- Publication date
- 2002
- Series
- Texts in theoretical computer science.
- ISBN
- 3540594361 (alk. paper)
- 9783540594369 (alk. paper)
Browse related items
Start at call number:
