Image from Amazon.com
Boolean function complexity / edited by M.S. Paterson.
Material type:
TextSeries: London Mathematical Society lecture note series ; 169Publication details: Cambridge ; New York, NY, USA : Cambridge University Press, 1992.Description: 201 p. : ill. ; 23 cmISBN: - 0521408261
- 511.3/24Â 20
- QA 267.7Â .B66 1992
| Item type | Current library | Call number | Status | Barcode | |
|---|---|---|---|---|---|
| Loan | Margaret Thatcher Library Second Floor | QA 267.7 .B66 1992 (Browse shelf(Opens below)) | Available | 10014320 | |
| Loan | Margaret Thatcher Library Second Floor | QA 267.7 .B66 1992 (Browse shelf(Opens below)) | Available | 10014321 |
Browsing Margaret Thatcher Library shelves,Shelving location: Second Floor Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| QA 267.5 .P76 Probabilistic reasoning and Bayesian belief networks / | QA 267.5 .P76 Probabilistic reasoning and Bayesian belief networks / | QA 267.5 .P76 Probabilistic reasoning and Bayesian belief networks / | QA 267.7 .B66 1992 Boolean function complexity / | QA 267.7 .B66 1992 Boolean function complexity / | QA 267.7.P57 Noisy information and computational complexity / | QA 268.H5 A first course in coding theory / |
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).
There are no comments on this title.
Log in to your account to post a comment.