书目

Markov Chains and Stochastic Stability (Cambridge Mathematical Library)

内容简介

Byconsideringthesizeofthelogicalnetworkneededtoperformagivencomputationaltask,theintrinsicdifficultyofthattaskcanbeexamined.Booleanfunctioncomplexity,thecombinatorialstudyofsuchnetworks,isasubjectthatstartedbackinthe1950sandhastodaybecomeoneofthemostchallengingandvigorousareasoftheoreticalcomputerscience.ThepapersinthisbookstemfromtheLondonMathematicalSocietySymposiumonBooleanFunctionComplexityheldatDurhamUniversityinJuly1990.Therangeoftopicscoveredwillbeofinteresttothenewcomertothefieldaswellastheexpert,andoverallthepapersarerepresentativeoftheresearchpresentedattheSymposium.AnyonewithaninterestinBooleanFunctioncomplexitywillfindthatthisbookisanecessarypurchase.

作者简介

SeanMeynisaprofessorintheDepartmentofElectricalandComputerEngineeringanddirectoroftheDivisionandControlLaboratoryoftheCoordinatedScienceLaboratoryattheUniversityofIllinois.Hehasservedontheeditorialboardsofseveraljournalsinareasofsystemsandcontrolandappliedprobability.RichardL.TweediewasProfessorandHeadoftheDivisionofBiostatisticsattheUniversityofMinnesotabeforehisdeathin2001.

—  END  —