Boolean Functions and Computation Models

Gebonden Engels 2002 2002e druk 9783540594369

€ 90,94

In winkelwagen

Levertijd ongeveer 9 werkdagen

Gratis verzonden

Samenvatting

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.