Boolean Functions and Computation Models

Author:   Peter Clote ,  Evangelos Kranakis
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   2002 ed.
ISBN:  

9783540594369


Pages:   602
Publication Date:   19 September 2002
Format:   Hardback
Availability:   Out of print, replaced by POD   Availability explained
We will order this item for you from a manufatured on demand supplier.

Our Price $287.76 Quantity:  
Add to Cart

Share |

Boolean Functions and Computation Models


Add your own review!

Overview

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 undergraduates and graduate students as well as researchers in the field of complexity theory.

Full Product Details

Author:   Peter Clote ,  Evangelos Kranakis
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2002 ed.
Dimensions:   Width: 15.50cm , Height: 3.30cm , Length: 23.50cm
Weight:   2.290kg
ISBN:  

9783540594369


ISBN 10:   3540594361
Pages:   602
Publication Date:   19 September 2002
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   Out of print, replaced by POD   Availability explained
We will order this item for you from a manufatured on demand supplier.

Table of Contents

Reviews

From the reviews: The monograph gives the most recent and complete description of lower bounds for depth-restricted circuits, and propositional proof systems. ... the authors present a research monograph on important subjects and provide many very recent results. I would recommend it for any university library and also for researchers. (Ingo Wegener, The Computer Journal, Vol. 46 (3), 2003)


From the reviews: <p> The monograph gives the most recent and complete description of lower bounds for depth-restricted circuits, and propositional proof systems. a ] the authors present a research monograph on important subjects and provide many very recent results. I would recommend it for any university library and also for researchers. (Ingo Wegener, The Computer Journal, Vol. 46 (3), 2003)


From the reviews: The monograph gives the most recent and complete description of lower bounds for depth-restricted circuits, and propositional proof systems. ! the authors present a research monograph on important subjects and provide many very recent results. I would recommend it for any university library and also for researchers. (Ingo Wegener, The Computer Journal, Vol. 46 (3), 2003)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List