LMS: 169 Boolean Function Complexty - Couverture souple

Paterson, M. S.

 
9780521408264: LMS: 169 Boolean Function Complexty
Couverture souple
ISBN 10 : 0521408261 ISBN 13 : 9780521408264
Editeur : Cambridge University Press, 2008

Synopsis

Here Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The participants include many well known figures in the field.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Cambridge University Press
Date d'édition
2008
Langue
anglais
ISBN 10 
0521408261
ISBN 13 
9780521408264
Reliure
Broché
Nombre de pages
212
Coordonnées du fabricant
non disponible
Personne responsable
Avery
https://www.avery.fr/

chemin des peupliers 27
Dardilly
France