1. Addis College
  2. Digital Library
  3. Computer Science
Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/8409
Title: The Complexity of Boolean Functions
The Complexity of Boolean Functions
Authors: Wegener, Ingo
Wegener, Ingo
Keywords: Algebra, Boolean
Computational complexity.
Electronic data processing—Mathematics
Issue Date: 1987
1987
Publisher: John Wiley & Sons
John Wiley & Sons
URI: http://localhost:8080/xmlui/handle/123456789/8409
ISBN: 0 471 91555 6
0 471 91555 6
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
The complexity of Boolean functions.pdf1.92 MBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.