关于生成独立随机串
On generating independent random strings
摘要：
它表明，从两个字符串是部分随机和独立的（在柯尔莫哥洛夫复杂性的意义上），它是可以有效地构建多项式许多字符串是随机的，成对独立的。如果两个初始字符串是随机的，则上述任务可以在多项式时间内执行。也可以在多项式时间内从具有恒定随机率的两个字符串构造随机字符串。
英文摘要：
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strings that are random and pairwise independent. If the two initial strings are random, then the above task can be performed in polynomial time. It is also possible to construct in polynomial time a random string, from two strings that have constant randomness rate.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
