Boolean functions and computation models
Author(s)
Bibliographic Information
Boolean functions and computation models
（Texts in theoretical computer science, An EATCS series）
Springer, c2002
Available at / 25 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index.
Description and Table of Contents
Description
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.
Table of Contents
1. Boolean Functions and Circuits.- 2. Circuit Lower Bounds.- 3. Circuit Upper Bounds.- 4. Randomness and Satisfiability.- 5. Propositional Proof Systems.- 6. Machine Models and Function Algebras.- 7. Higher Types.- References.
by "Nielsen BookData"
