| Boolean Function Complexity Contributor(s): Paterson, M. S. (Editor), Hitchin, N. J. (Editor), Paterson, Michael S. (Other) |
|
 |
ISBN: 0521408261 ISBN-13: 9780521408264 Publisher: Cambridge University Press OUR PRICE: $44.64 Product Type: Paperback - Other Formats Published: November 1992 Annotation: Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The list of participants includes very well known figures in the field, and the topics covered will be significant to many mathematicians and computer scientists working in related areas. |
| Additional Information |
| BISAC Categories: - Computers - Mathematics | Algebra - General |
| Dewey: 511.324 |
| LCCN: 93111192 |
| Series: Modern European Philosophy (Paperback) |
| Physical Information: 0.48" H x 6" W x 9" (0.70 lbs) 212 pages |