UID:
almahu_9948621121302882
Umfang:
XIV, 602 p.
,
online resource.
Ausgabe:
1st ed. 2002.
ISBN:
9783662049433
Serie:
Texts in Theoretical Computer Science. An EATCS Series,
Inhalt:
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.
Anmerkung:
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.
In:
Springer Nature eBook
Weitere Ausg.:
Printed edition: ISBN 9783642082177
Weitere Ausg.:
Printed edition: ISBN 9783540594369
Weitere Ausg.:
Printed edition: ISBN 9783662049440
Sprache:
Englisch
DOI:
10.1007/978-3-662-04943-3
URL:
https://doi.org/10.1007/978-3-662-04943-3
