Pastāsti draugiem par šo preci:
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 1992. gada 5. novembris |
| ISBN13 | 9780521408264 |
| Izdevēji | Cambridge University Press |
| Lapas | 212 |
| Izmēri | 151 × 227 × 11 mm · 315 g |
| Valoda | Angļu |
| Redaktors | Paterson, M. S. (University of Warwick) |