Boolean Function Complexity

M. S. Paterson (u. a.)

ISBN 10: 0521408261 / ISBN 13: 9780521408264

Published by Cambridge University Press, 2005

About this Item

Boolean Function Complexity | M. S. Paterson (u. a.) | Taschenbuch | Kartoniert / Broschiert | Englisch | 2005 | Cambridge University Press | EAN 9780521408264 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 102233381

Bibliographic Details

• Title: Boolean Function Complexity
• Publisher: Cambridge University Press
• Publication Date: 2005
• Language: English
• ISBN 10: 0521408261
• ISBN 13: 9780521408264
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 229W x 152H x 13D millimeters 229 millimeters width by 152 millimeters height by 13 millimeters depth
• Weight: 352 grams
• Seller catalogs:
  • Bücher

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.