M. S. Paterson (ed.)
Broschiertes Buch

Boolean Function Complexity

Versandkostenfrei!
Versandfertig in 1-2 Wochen
48,99 €
inkl. MwSt.
Weitere Ausgaben:
PAYBACK Punkte
24 °P sammeln!
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. Here 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.Table of contents:1. Relationships between monotone and non-monotone network complexity; 2. On read-once Boole...