The complexity of Boolean functions
By: Ingo Wegener.
Series: Wiley-Teubner series in computer science
Publisher: B.G. Teubner; J. Wiley
Published: 1987
Place of publication: Stuttgart; Chicester [West Sussex]; New York
Language: eng
Number of pages: 457
Subjects: Algebra, Boolean.; Computational complexity.
Notes: Bibliography: p. 442-454.
Includes index.