Download WordPress Themes, Happy Birthday Wishes
Home » Computer » The Complexity of Boolean Functions

The Complexity of Boolean Functions

  • Category: Computer
  • Author: Ingo Wegener
  • Pages: 470 pages
  • File type: Online, PDF, 1.9 MB

Read and download free eBook intituled The Complexity of Boolean Functions in format Online, PDF, 1.9 MB – 470 pages created by Ingo Wegener.


Research on the complexity of Boolean functions in non-uniform computation models is now part of one of the most interesting and important areas in theoretical computer science. It has a direct relevance to practical problems in the computer aided design of digital circuits.

This book presents a large number of recent research results f Boolean functions 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.

Read and Download Links:

The Complexity of Boolean Functions


READ  TeX for the Impatient

Leave a Reply

Your email address will not be published. Required fields are marked *



Check Also

The Linux Command Line

Read and download free Book intituled The Linux Command Line in format PDF written by William Shotts.