Boolean function complexity, LMS 169 edited by M.S. Paterson.
By: Paterson, Michael S., edt.
Contributor(s): 0.
Material type:
TextSeries: London Mathematical Society lecture note series ; 169. Publisher: Cambridge ; New York, NY, USA : Cambridge University Press, 1992Description: 201 p. ill. ; 23 cm.ISBN: 0521408261.Subject(s): Computational complexity -- Congresses | Algebra, BooleanOnline resources: Publisher description | Table of contents
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
| Book | Chennai Mathematical Institute | 511.352 PAT (Browse shelf) | Available | 5226 | ||
| Book | Chennai Mathematical Institute | 511.352 PAT (Browse shelf) | Available | 878 |
Total holds: 0
Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society.
Includes bibliographical references (p. 198-201).