Boolean function complexity
By: edited by M.S. Paterson
Contributors: Paterson, Michael S
Series: London Mathematical Society lecture note series -- 169; London Mathematical Society lecture note series -- 169
Publisher: Cambridge University Press
Published: 1992
Place of publication: Cambridge; New York
Language: eng
Number of pages: 201
Subjects: Algebra, Boolean -- Congresses; Computational complexity -- Congresses
Notes: Includes bibliographical references