Modeling time-bounded prefix Kolmogorov complexity
From MaRDI portal
Publication:1974444
DOI10.1007/s002249910008zbMath1008.68059OpenAlexW1990402527MaRDI QIDQ1974444
Publication date: 7 May 2000
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002249910008
This page was built for publication: Modeling time-bounded prefix Kolmogorov complexity