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.
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series) pdf download
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series) book series pdf
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series) by Peter Clote ebook pdf epub mobi
Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series) reviews
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.