Boolean Function Complexity

Título:
Boolean Function Complexity
Autor:
Paterson
Materia:
Computer Science; Mathematics; European History after 1450; European Studies; Middle East History
Editor:
Cambridge University Press
Descripción:
Books for Research
Identificadores:
E-ISBN: 9780511526633 ISBN: 9780521408264
Colección:
Cambridge University Press