Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

Boolean Function Complexity

Name: Boolean Function Complexity
Brand: Cambridge University Press
SKU: 02029882
Price: 46.44 EUR
Availability: InStock
Author: M. S. Paterson
ISBN: 9780521408264

M. S. Paterson

Língua

Inglês

Livro Capa mole

Código Libristo: 02029882

Editoras Cambridge University Press, novembro 1992

By considering the size of the logical network needed to perform a given computational task, the int... Descrição completa

Código Libristo: 02029882

113 b

46.44 €

Armazenamento externo Envio em 9-15 dias

Política de devolução de 30 dias

Os clientes também compraram

Sprache der Symbole, Spache der Natur Omraam M. Aivanhov

Livro de capa dura

16.25 €

JOAN TRIADU, L'IMPULS OBSTINAT PONS

Livro de capa dura

17.15 €

Vom Jiu-Jitsu zur effektiven Deeskalation Dennis Müssener

Capa mole

11.20 €

Ihr habt Euren Glauben, ich indes habe meinem... M Razavi Rad

Capa mole

17.46 €

Objektive Berichterstattung oder erkaufte Prasenz Florian Riedel

Capa mole

31.49 €

Sport-Hypnose R. F.-J. K. Eck

Capa mole

19.68 €

REIKI Brigitte Grimberg

Livro de capa dura

17.36 €

Aggressionspraevention bei Madchen und Jungen Livia Hafner

Capa mole

37.65 €

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.