scientific article; zbMATH DE number 1048038

zbMATH Open0874.03049MaRDI QIDQ4348124FDOQ4348124

Authors: José L. Balcázar, Ricard Gavaldà, M. Hermo 

Publication date: 22 September 1997

Title of this publication is not available (Why is that?)

Recommendations

• Compressibility and uniform complexity
• Time-bounded incompressibility of compressible strings and sequences
• Kobayashi compressibility
• Compressibility and resource bounded measure
• Kolmogorov-Complexity Based on Infinite Computations

zbMATH Keywords

Kolmogorov complexitycompressibilityinfinite binary sequencesresource boundspolynomial-time computable

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (7)

• Finite State Incompressible Infinite Sequences
• Compressibility and uniform complexity
• Time-bounded incompressibility of compressible strings and sequences
• Compressibility of Deterministic and Random Infinite Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kobayashi compressibility

This page was built for publication:

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