Boolean function complexity
By: edited by M.S. Paterson.
Contributors: Paterson, Michael S.
Series: London Mathematical Society lecture note series ;; 169
Publisher: Cambridge University Press
Published: 1992
Place of publication: Cambridge; New York, NY, USA
Language: eng
Number of pages: 201
Subjects: Computational complexity -- Congresses; Algebra, Boolean
Notes: Includes bibliographical references (p. 198-201).
Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society.