| Document Date: 2013-07-09 03:09:56
Open Document File Size: 534,18 KBShare Result on Facebook
City Wien / / Company ACM Inc. / / Currency USD / / / Facility Purdue University / / IndustryTerm data compression algorithm / limit law / copyright/server / precise asymptotic solutions / compression algorithms / precise solution / arithmetic coding algorithm / real solution / non-zero integer solution / at presenting precise asymptotic solutions / / Organization National Science Foundation / Department of Computer Science / Purdue University / / Person WOJCIECH SZPANKOWSKI TU / Discrete Master / MICHAEL DRMOTA / Discrete Master Theorem / / Position Author / log pm / Prime Minister / General / pj Pm / / ProgrammingLanguage C / / PublishedMedium Journal of the ACM / the Boncelet Journal / / Technology data compression algorithm / Karatsuba algorithm / Tunstall algorithm / Strassen algorithm / Boncelet coding algorithm / Boncelet algorithm / compression algorithms / arithmetic coding algorithm / /
SocialTag |
A Master Theorem for Discrete Divide and Conquer Recurrences MICHAEL DRMOTA and WOJCIECH SZPANKOWSKI TU Wien and Purdue University Divide-and-conquer recurrences are one of the most studied equations in computer science.