ENGLISH

Boolean Functions and Computation Models

By Peter Clote , Evangelos Kranakis

Book information

Publisher
Springer
Year
2002
ISBN
3540594361, 9783540594369
LCC
QA267.7 .C58 2001
Language
english
Format
PDF
Filesize
7 MB (7359350 bytes)
Series
Texts in Theoretical Computer Science. An EATCS Series
Pages
616\616
DPI
600
Orientation
portrait
Paginated
yes
Scanned
yes
Time added
2012-02-04 16:00:00

Description

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.

Similar books