Boolean function complexity ed. Lecture note series 169.

ISBN 10: 0511526636 / ISBN 13: 9780511526633

Published by Cambridge, Cambridge University Press, 1992

About this Item

Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 68 BOO 9780511526633 Sprache: Englisch Gewicht in Gramm: 550.

Seller Inventory # 2503983

Bibliographic Details

• Title: Boolean function complexity ed. Lecture note series 169.
• Publisher: Cambridge, Cambridge University Press
• Publication Date: 1992
• Language: English
• ISBN 10: 0511526636
• ISBN 13: 9780511526633
• Binding: Softcover
• Weight: 550 grams
• Seller catalogs:
  • SA MATHEMATIK

About this title

Synopsis

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.

Book Description

Papers from the 1990 Durham symposium on Boolean function complexity reveal exciting advances over recent years in a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods.