期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2001
卷号：2001
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We invistigate what is the minimal length of a program mapping A to B and at the same time mapping C to D (where A,B,C,D are binary strings). We prove that it cannot be expressed in terms of Kolmogorv complexity of A,B,C,D, their pairs (A,B), (A,C), ..., their triples (A,B,C), (A,B,D), ..., and the quadruple (A,B,C,D) up to an additive term of O(K(A,B,C,D)).
