A polynomial-time algorithm for computing absolutely normal numbers.

Verónica Becher,Pablo Ariel Heiber,Theodore A. Slaman

Information and Computation（2013）

引用 46|浏览0

暂无评分

摘要

We give an algorithm to compute an absolutely normal number so that the first n digits in its binary expansion are obtained in time polynomial in n; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.

查看译文

关键词

time polynomial,binary expansion,n digit,normal number,combinatorial tool,polynomial-time algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要