分享给好友:
Boolean Function Complexity - London Mathematical Society Lecture Note Series M S Paterson
Boolean Function Complexity - London Mathematical Society Lecture Note Series
M S Paterson
Boolean function complexity has seen exciting advances in the last few years. It is a long established area of discrete mathematics which uses combinatorial and occasionally algebraic methods.
212 pages, some line drawings, some tables
| 介质类型 | 图书 Paperback Book (平装胶订图书) |
| 已发行 | 1992年11月5日 |
| ISBN13 | 9780521408264 |
| 出版商 | Cambridge University Press |
| 页数 | 212 |
| 商品尺寸 | 151 × 227 × 11 mm · 315 g |
| 语言 | 英语 |
| 编辑 | Paterson, M. S. (University of Warwick) |