小阶乘与素数阶乘的直线程序复杂度
计算复杂性
2014-12-16 v4 离散数学
数论
摘要
本文确定了 时 的直线程序复杂度，并给出了直至 的复杂度界。同样地，我们确定了直至 的首个素数乘积的直线程序复杂度，并给出了 的界。我们的结果基于对短长度直线程序进行的穷尽计算机搜索。
引用
@article{arxiv.1306.3091,
title = {The straight line complexity of small factorials and primorials},
author = {Klas Markström},
journal= {arXiv preprint arXiv:1306.3091},
year = {2014}
}
备注
V4: Published version. Reformatted to journal format. Minor typos corrected. v3: Updated acknowledgments, improved some of the lower bounds after recomputing all data with a new program, corrected two incorrect lower bounds due a damaged datafile from the original 10 year old computation. V2: Corrected typos and a mistake in table 2