عنوان

Boolean function complexity /

(Number (ISBN

0511526636

(Number (ISBN

1107361729

(Number (ISBN

9780511526633

(Number (ISBN

9781107361720

Erroneous ISBN

0521408261

Erroneous ISBN

9780521408264

Number

b736450

Title Proper

Boolean function complexity /

General Material Designation

[Book]

First Statement of Responsibility

edited by M.S. Paterson.

Place of Publication, Distribution, etc.

New York, NY, USA :

Name of Publisher, Distributor, etc.

Cambridge University Press,

Date of Publication, Distribution, etc.

1992.

Specific Material Designation and Extent of Item

1 online resource (201 pages) :

Other Physical Details

illustrations

Series Title

London Mathematical Society lecture note series ;

Volume Designation

169

Text of Note

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

Text of Note

Includes bibliographical references (pages 198-201).

Text of Note

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.

Title

Boolean function complexity.

International Standard Book Number

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

Number

Edition

Class number

Book number

Class number

Class number

Class number

Class number

Class number

Class number

Class number

System Code

System Code

System Code

System Code

System Code

System Code

System Code

Paterson, Michael S.

Date of Transaction

20201203201453.0

Cataloguing Rules (Descriptive Conventions))

pn

Electronic name

[Book]

Y