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
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWegener, Ingo-
dc.contributor.authorWegener, Ingo-
dc.date.accessioned2026-04-27T14:45:27Z-
dc.date.available2026-04-27T14:45:27Z-
dc.date.issued1987-
dc.date.issued1987-
dc.identifier.isbn0 471 91555 6-
dc.identifier.isbn0 471 91555 6-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/8409-
dc.language.isoenen_US
dc.language.isoenen_US
dc.publisherJohn Wiley & Sonsen_US
dc.publisherJohn Wiley & Sonsen_US
dc.subjectAlgebra, Booleanen_US
dc.subjectComputational complexity.en_US
dc.subjectElectronic data processing—Mathematicsen_US
dc.titleThe Complexity of Boolean Functionsen_US
dc.titleThe Complexity of Boolean Functionsen_US
dc.typeBooken_US
dc.typeBooken_US
Appears in Collections:Computer Science

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


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