ENGLISH

Boolean functions and computation models

By Peter Clote , Evangelos Kranakis

Book information

Publisher
Springer
Year
2002
ISBN
3540594361, 9783540594369
Language
english
Format
PDF
Filesize
15 MB (16096026 bytes)
Series
Texts in Theoretical Computer Science. An EATCS Series
Pages
620\620
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