内容简介
Byconsideringthesizeofthelogicalnetworkneededtoperformagivencomputationaltask,theintrinsicdifficultyofthattaskcanbeexamined.Booleanfunctioncomplexity,thecombinatorialstudyofsuchnetworks,isasubjectthatstartedbackinthe1950sandhastodaybecomeoneofthemostchallengingandvigorousareasoftheoreticalcomputerscience.ThepapersinthisbookstemfromtheLondonMathematicalSocietySymposiumonBooleanFunctionComplexityheldatDurhamUniversityinJuly1990.Therangeoftopicscoveredwillbeofinteresttothenewcomertothefieldaswellastheexpert,andoverallthepapersarerepresentativeoftheresearchpresentedattheSymposium.AnyonewithaninterestinBooleanFunctioncomplexitywillfindthatthisbookisanecessarypurchase.