01332nam0 2200301 i 450 SUN007663020151120101600.498978-05-214-0826-420100917d1992 |0engc50 baengGB|||| |||||Boolean function complexityedited by M. S. PatersonCambridgeCambridge university1992201 p.23 cm.001SUN00295282001 *London Mathematical Society lecture notes series169210 CambridgeCambridge university.68-XXComputer science [MSC 2020]MFSUNC01967094-XXInformation and communication theory, circuits [MSC 2020]MFSUNC01970100B25Proceedings of conferences of miscellaneous specific interest [MSC 2020]MFSUNC02073206E30Boolean functions [MSC 2020]MFSUNC027709CambridgeSUNL000024Paterson, Michael S.SUNV042639Cambridge universitySUNV000097650ITSOL20201012RICASUN0076630UFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA08PREST 68-XX 3171 08 2006 I 20100917 Boolean function complexity376422UNICAMPANIA