Boolean Function Complexity
€45,85€47,74-3%
Currently out of stockLeave your email and we will let you know as soon as it is back, usually within 3-4 weeks.
14-day return guaranteeChanged your mind? You can cancel your order any time or return it within 14 days. Return policy
About the book
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.
| Author | M. S. (University of Warwick) Paterson |
|---|---|
| Publisher | Cambridge University Press |
| Published | 1992 m. |
| Language | English |
| Pages | 212 psl. |
| Format | Paperback |
| ISBN | 9780521408264 |