20 random strings (sorted from lowest to highest complexity values) from the first half of <i>D</i>(5) to which the coding theorem has been applied (extreme right column) to approximate <i>K</i>(<i>s</i>).
收藏NIAID Data Ecosystem2026-03-08 收录
数据链接：
官方服务：
资源简介：
20 random strings (sorted from lowest to highest complexity values) from the first half of D(5) to which the coding theorem has been applied (extreme right column) to approximate K(s).
创建时间：
2014-05-08
