Boolean Functions and Computation Models - Brossura

Clote, Peter; Kranakis, Evangelos

Brossura

ISBN 10: 3642082173 ISBN 13: 9783642082177

Casa editrice: Springer, 2010

Riassunto

This advanced textbook surveys research on boolean functions, circuits, parallel computation models, function algebras, and proof systems, with an overriding focus on the structure of "fast" parallel computation.

Su questo libro

Dalla quarta di copertina

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.

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 3642082173
• ISBN 13: 9783642082177
• Rilegatura: Copertina flessibile
• Numero di pagine: 620
• Contatto del produttore: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Poststr. 9; Darmstadt; 64293; Germania