Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: Boolean Function Complexity (London Mathematical Society Lecture Note Series)
Автор: Paterson M.
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.