Boolean Function Complexity

Name: Boolean Function Complexity
Brand: M. S. (University of Warwick) Paterson
SKU: 9780521408264
Price: 45.85 EUR
Availability: InStock

M. S. (University of Warwick) Paterson

€45,85

€45,85 €47,74 Väljamüük

Meil on laos

Toodet hetkel ei ole

Jätke oma e-posti aadress ja anname teada, kui toode on taas laos.

Autorius M. S. (University of Warwick) Paterson

Kalba Anglų k.

Leidėjas Cambridge University Press

Leidimo metai 1992 m.

Puslapių skč. 212 psl.

Viršelis Minkštas viršelis

ISBN 9780521408264

Kategorijos Kõik kategooriad, Kõik tooted, Matemaatiline loogika

Boolean Function Complexity

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.

Boolean Function Complexity

€45,85

€45,85 €47,74

Riik/piirkond

Boolean Function Complexity

Boolean Function Complexity