00876nam0-22003011i-450-99000132956040332120100215150507.00-521-40826-1000132956FED01000132956(Aleph)000132956FED0100013295620001205d1992----km-y0itay50------baengBoolean function complexityEdited by M. S. Paterson.Cambridge (NY)Cambridge University Pressc1992ix, 201 p.24 cmLondon Mathematical Society lecture note series169Computer scienceCongressi005.131Paterson,M.S.ITUNINARICAUNIMARCBK990001329560403321C-9-(16910194MA1MA1Boolean function complexity376422UNINA