Boolean Function ComplexityBoolean Function Complexity
Title rated 0 out of 5 stars, based on 0 ratings(0 ratings)
eBook, 1992
Current format, eBook, 1992, , All copies in use.
eBook, 1992
Current format, eBook, 1992, , All copies in use. Offered in 0 more formats
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. Here Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The participants include many well known figures in the field.
From the community