摘要
Analyzingtheaverage-casecomplexityofalgorithmsisaverypracticalbutverydifficultproblemincomputerscience.Inthepastfewyears,wehavedemonstratedthatKolmogorovcomplexityisanimprotanttoolforanalyzingtheaverage-casecomplexityofalgorithms.Wehavedevelopedtheincompressibilitymethod.Inthispaper,sereralsimpleexamplesareusedtofurtherdemonstratethepowerandsimplicityofsuchmethod.Weproveboundsontheaverage-casenumberofstacks(queues)requiredforsortingsequentialorparallelQueuesortorStacksort.
出版日期
2000年05月15日(中国Betway体育网页登陆平台首次上网日期,不代表论文的发表时间)