Povej prijatelju o tem izdelku:
Boolean Function Complexity - London Mathematical Society Lecture Note Series M S Paterson
Cena
€ 54,49
Naročeno iz oddaljenega skladišča
Predvidena dobava 8. - 22. sep
Prejemajte obvestila o novih izdajah izvajalca M S Paterson
Kaj pravijo naše stranke:
Dodaj na svoj seznam želja iMusic
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
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 5. novembra 1992 |
| ISBN13 | 9780521408264 |
| Založniki | Cambridge University Press |
| Strani | 212 |
| Dimenzije | 151 × 227 × 11 mm · 315 g |
| Jezik | Angleščina |
| Urednik | Paterson, M. S. (University of Warwick) |
