On symmetry of information and polynomial time invertibility
From MaRDI portal
Publication:1898110
DOI10.1006/INCO.1995.1120zbMath0832.68059OpenAlexW1996484429MaRDI QIDQ1898110
Publication date: 20 February 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1120
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Measures of information, entropy (94A17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
Some properties of antistochastic strings ⋮ One-way functions using algorithmic and classical information theories ⋮ On Resource-Bounded Versions of the van Lambalgen Theorem ⋮ Resource bounded symmetry of information revisited ⋮ On optimal language compression for sets in PSPACE/poly
This page was built for publication: On symmetry of information and polynomial time invertibility