01268nam a2200313 i 450099100072077970753620020507172725.0001106s1992 uk ||| | eng 0521408261b10747965-39ule_instLE01301261ExLDip.to Matematicaeng519.4AMS 68-06Paterson, Michael S.534793Boolean function complexity /edited by M. S. PatersonCambridge :Cambridge University Press,1992201 p. :ill. ;23 cmLondon Mathematical Society lecture note series,0076-0552 ;169Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society.Includes bibliographical referencesBoolean algebraComputational complexityCongresses.b1074796523-02-1728-06-02991000720779707536LE013 68-XX PAT11 (1992)12013000122939le013-E0.00-l- 01010.i1084040028-06-02Boolean function complexity911605UNISALENTOle01301-01-00ma -enguk 01