E-Book, Englisch, 602 Seiten, eBook
Reihe: Texts in Theoretical Computer Science. An EATCS Series
Clote / Kranakis Boolean Functions and Computation Models
2002
ISBN: 978-3-662-04943-3
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
E-Book, Englisch, 602 Seiten, eBook
Reihe: Texts in Theoretical Computer Science. An EATCS Series
ISBN: 978-3-662-04943-3
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
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.
Zielgruppe
Graduate
Autoren/Hrsg.
Weitere Infos & Material
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.
