Alta reperibilità
Boolean Function Complexity
- Editore:
Cambridge University Press
- EAN:
9780521408264
- ISBN:
0521408261
- Pagine:
- 212
- Formato:
- Paperback
- Lingua:
- Inglese
Acquistabile con
o la
Descrizione Boolean Function Complexity
Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The list of participants includes very well known figures in the field, and the topics covered will be significant to many mathematicians and computer scientists working in related areas.
Disponibile in 10-12 giorni
Recensioni degli utenti
e condividi la tua opinione con gli altri utenti