Fri frakt over 399 kr
Fri frakt over 399 kr
Kundeservice
Boolean Function Complexity
-2 %

Boolean Function Complexity

477 kr

477 kr

Tidligere laveste pris:

485 kr

På lager

Fr., 4 juli - to., 10 juli


Sikker betaling

14 dagers åpent kjøp


Selges og leveres av

Adlibris

Produktbeskrivelse

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.

Artikkel nr.

6b35fb5b-3ae9-43fb-a1f1-d3fff6313411

Boolean Function Complexity

477 kr

477 kr

Tidligere laveste pris:

485 kr

På lager

Fr., 4 juli - to., 10 juli


Sikker betaling

14 dagers åpent kjøp


Selges og leveres av

Adlibris