ISAAC 1992: Algorithms and Computation pp 410-419

# On symmetry of information and polynomial time invertibility

• Luc Longpré
• Osamu Watanabe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

## Abstract

Symmetry of information states that for two strings x and y, K(xy)=K(x)+K(y ¦ x)±O(log¦xy¦). We consider the statement of whether symmetry of information holds in a polynomial time bounded environment. Intuitively, this problem is related the complexity of inverting a polynomial time computable function. We give some evidence supporting this intuition, by proving the following relations:
1. 1.

If the polynomial time symmetry of information holds, then there is a polynomial time algorithm that computes the shortest description of a string for “almost all” strings.

2. 2.

If the polynomial time symmetry of information holds, then every polynomial time computable function is probabilistic polynomial time invertible for “almost all” strings in its domain.

3. 3.

If P=NP (i.e., every polynomial time computable function is polynomial time invertible), then the polynomial time symmetry of information holds.

## Keywords

Polynomial Time Polynomial Time Algorithm Kolmogorov Complexity Random String Probabilistic Polynomial Time
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. [BDG88]
J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, 1988.Google Scholar
2. [Gác74]
P. Gács. On the symmetry of algorithmic information. Soviet Math. Dokl., 15:1477, 1974.Google Scholar
3. [LM91]
L. Longpré and S. Mocas. Symmetry of information and one-way functions. In ISA '91 Algorithms, Lecture notes in Computer Science, pages 308–315. Springer-Verlag, 557, 1991.Google Scholar
4. [LV88]
M. Li and P.M.B. Vitányi. Two decades of applied kolmogorov complexity. In Proc. Structure in Complexity Theory third annual conference, pages 80–101, 1988.Google Scholar
5. [Sip83]
M. Sipser. A complexity theoretic approach to randomness. In Proc. 15th ACM Symposium on Theory of Computing, pages 330–335, 1983.Google Scholar
6. [ZL70]
A.K. Zvonkin and L.A. Levin. The complexity of finite objects and the development of the concepts of information and raudomness by means of the theory of algorithms. Russ. Math. Surv., 25:83–124, 1970.Google Scholar