Uniformly reasonable source encoding is often practically impossible

DOI10.1109/TIT.1975.1055413zbMATH Open0395.94016OpenAlexW2041493225MaRDI QIDQ4178907FDOQ4178907

Authors: Terrence L. Fine 

Publication date: 1975

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1975.1055413

zbMATH Keywords

Computational ComplexitySource Encoding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Source coding (94A29)

Cited In (1)

• Uncontrollable computational growth in theoretical physics

This page was built for publication: Uniformly reasonable source encoding is often practically impossible

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178907)