Average-case analysis of algorithms using Kolmogorov complexity
- 1 September 2000
- journal article
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 15 (5) , 402-408
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An Introduction to Kolmogorov Complexity and Its Applications1997
- A variational problem for random Young tableauxAdvances in Mathematics, 1977
- Subadditive Ergodic TheoryThe Annals of Probability, 1973
- Sorting Using Networks of Queues and StacksJournal of the ACM, 1972
- A high-speed sorting procedureCommunications of the ACM, 1959