عنوان

Boolean function complexity /

0511526636

1107361729

9780511526633

9781107361720

0521408261

9780521408264

b736450

Boolean function complexity /

[Book]

edited by M.S. Paterson.

New York, NY, USA :

Cambridge University Press,

1992.

1 online resource (201 pages) :

illustrations

London Mathematical Society lecture note series ;

169

Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society.

Includes bibliographical references (pages 198-201).

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.

Boolean function complexity.

0521408261

Algebra, Boolean.

Computational complexity, Congresses.

Algebra, Boolean.

Boole, algèbre de-- Congrès.

Boolean-functions.

Boolesche Funktion

Complexité de calcul (Informatique)-- Congrès.

Computational complexity.

Komplexitätstheorie

MATHEMATICS-- Algebra-- General.

MAT-- 002000

Paterson, Michael S.

20201203201453.0

pn

[Book]

Y