01412nam0 2200313 i 450 VAN007663020240130083120.289978-05-214-0826-420100917d1992 |0itac50 baengGB|||| |||||Boolean function complexityedited by M. S. PatersonCambridgeCambridge university1992201 p.23 cm001VAN00295282001 London Mathematical Society lecture notes series210 CambridgeCambridge university.16968-XXComputer science [MSC 2020]VANC019670MF94-XXInformation and communication theory, circuits [MSC 2020]VANC019701MF00B25Proceedings of conferences of miscellaneous specific interest [MSC 2020]VANC020732MF06E30Boolean functions [MSC 2020]VANC027709MFCambridgeVANL000024PatersonMichael S.VANV042639Cambridge university <editore>VANV107986650ITSOL20240202RICABIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICAIT-CE0120VAN08VAN0076630BIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA08PREST 68-XX 3171 08 2006 I 20100917 Boolean function complexity376422UNICAMPANIA