Boolean Functions and Computation Models. Texts in Theoretical Computer Science EATCS

Seitenzahl:

601

Gewicht:

1066 g

Erschienen bei:

Springer

Kurzbeschreibung

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. TOC: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

Beschreibung

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.

Mehr über...

Mehr über:  Mathematik / Informatik, Computer, Datenverarbeitung, Komplexitätstheorie, Boolesche Algebra, Beweis (Math.), Logic, Discrete Mathematics, Paralleles Rechnen, Beweissysteme, Boolesche Funktionen, Boolesche Funktion, Computer. Logic. Discrete Mathematics Informatik

Mehr von: 

Mehr von:  Evangelos Kranakis, Peter Clote, Springer-Verlag GmbH