424491
9780521408264
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.Paterson, M. S. is the author of 'Boolean Function Complexity' with ISBN 9780521408264 and ISBN 0521408261.
[read more]