ENGLISH

Boolean Function Complexity

By M. S. Paterson

Book information

Publisher
Cambridge University Press
Year
1992
ISBN
9780521408264, 9780511526633, 0521408261, 0511526636
LCC
QA267.7 .B66 1992
Open Library ID
OL1456432M
Language
english
Format
DJVU
Filesize
1 MB (1214360 bytes)
Series
London Mathematical Society Lecture Note Series
Pages
211\211
Library
Kolxo3
DPI
300
Time added
2010-11-11 16:01:50
Математика;Дискретная математика

Description

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.

Similar books