849:-
Uppskattad leveranstid 7-12 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
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.
- Format: Pocket/Paperback
- ISBN: 9780521408264
- Språk: Engelska
- Antal sidor: 212
- Utgivningsdatum: 1992-11-05
- Förlag: Cambridge University Press