Boolean Function Complexity (London Mathematical Society Lecture Note Series)

Libro 155 de 387: London Mathematical Society Lecture Notes
 
9780511526633: Boolean Function Complexity (London Mathematical Society Lecture Note Series)
ISBN 10: 0511526636 ISBN 13: 9780511526633

Reseña del editor

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.

Descripción del libro

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Idioma
Inglés
ISBN 10 
0511526636
ISBN 13 
9780511526633
Encuadernación
Printed Access Code
Contacto del fabricante
no disponible
Persona responsable
no disponible

Otras ediciones populares con el mismo título

9780521408264: LMS: 169 Boolean Function Complexty (London Mathematical Society Lecture Note Series, Series Number 169)

Edición Destacada

ISBN 10:  0521408261 ISBN 13:  9780521408264
Editorial: Cambridge University Press, 2008
Tapa blanda