The Complexity of Boolean Functions

The Complexity of Boolean Functions
Author :
Publisher :
Total Pages : 502
Release :
ISBN-10 : STANFORD:36105032371630
ISBN-13 :
Rating : 4/5 ( Downloads)

Book Synopsis The Complexity of Boolean Functions by : Ingo Wegener

Download or read book The Complexity of Boolean Functions written by Ingo Wegener and published by . This book was released on 1987 with total page 502 pages. Available in PDF, EPUB and Kindle. Book excerpt:


The Complexity of Boolean Functions Related Books

The Complexity of Boolean Functions
Language: en
Pages: 502
Authors: Ingo Wegener
Categories: Algebra, Boolean
Type: BOOK - Published: 1987 - Publisher:

GET EBOOK

Boolean Models and Methods in Mathematics, Computer Science, and Engineering
Language: en
Pages: 781
Authors: Yves Crama
Categories: Computers
Type: BOOK - Published: 2010-06-28 - Publisher: Cambridge University Press

GET EBOOK

A collection of papers written by prominent experts that examine a variety of advanced topics related to Boolean functions and expressions.
Boolean Functions and Computation Models
Language: en
Pages: 612
Authors: Peter Clote
Categories: Computers
Type: BOOK - Published: 2013-03-09 - Publisher: Springer Science & Business Media

GET EBOOK

The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ra
Analysis of Boolean Functions
Language: en
Pages: 445
Authors: Ryan O'Donnell
Categories: Computers
Type: BOOK - Published: 2014-06-05 - Publisher: Cambridge University Press

GET EBOOK

This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced to
Boolean Functions
Language: en
Pages: 711
Authors: Yves Crama
Categories: Mathematics
Type: BOOK - Published: 2011-05-16 - Publisher: Cambridge University Press

GET EBOOK

Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspe