HUDU

Boolean Function Complexity

Jetzt
€ 49,99
Bisher € 50,49
 
kartoniert
Lieferbar innert 2 Wochen
Dezember 2005

Beschreibung

Beschreibung

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.

Inhaltsverzeichnis

1. Relationships between monotone and non-monotone network complexity; 2. On read-once Boolean functions; 3. Boolean function complexity: a lattice-theoretic perspective; 4. Monotone complexity; 5. On submodular complexity measures; 6. Why is Boolean complexity so difficult?; 7. The multiplicative complexity of Boolean quadratic forms; 8. Some problems involving Razborov-Smolensky polynomials; 9. Symmetry functions in AC0; 10. Boolean complexity and probabilistic constructions; 11. Networks computing Boolean functions for multiple input values; 12. Optimal carry save networks.
EAN: 9780521408264
ISBN: 0521408261
Untertitel: 'Modern European Philosophy (Pa'. New. Sprache: Englisch.
Verlag: CAMBRIDGE UNIV PR
Erscheinungsdatum: Dezember 2005
Seitenanzahl: 212 Seiten
Format: kartoniert
Es gibt zu diesem Artikel noch keine Bewertungen.Kundenbewertung schreiben