Povedzte o tejto položke priateľom:
Boolean Function Complexity - London Mathematical Society Lecture Note Series M S Paterson
Boolean Function Complexity - London Mathematical Society Lecture Note Series
M S Paterson
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.
212 pages, some line drawings, some tables
| Médium | Knihy Paperback Book (Kniha s mäkkou väzbou a lepeným chrbtom) |
| Vydané | 05. novembra 1992 |
| ISBN13 | 9780521408264 |
| Vydavatelia | Cambridge University Press |
| Strany | 212 |
| Rozmery | 151 × 227 × 11 mm · 315 g |
| Jazyk | Angličtina |
| Editor | Paterson, M. S. (University of Warwick) |
Vianočné darčeky je možné vrátiť do 31. januára