The Complexity of Boolean Functions

The Complexity of Boolean Functions - Wiley-Teubner Series in Computer Science

Hardback (22 Jul 1987)

Not available for sale

Includes delivery to the United States

Out of stock

This service is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Publisher's Synopsis

Presents a large number of recent research results previously unavailable in book form. Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. Includes basic theory as well recent research findings. Each chapter includes exercises.

Book information

ISBN: 9780471915553
Publisher: Wiley
Imprint: John Wiley & Sons, Inc.
Pub date:
DEWEY: 511.32
DEWEY edition: 18
Language: English
Number of pages: 457
Weight: 880g
Height: 237mm
Width: 153mm
Spine width: 33mm