时间复杂度为O(n^2.5)
Computing an Integer Prime Factoring in O(n^2.5)
摘要:
纸被收回。在审查的文件贡献不大的意义。所提出的算法的运行时分析,而正确的操作的数量方面,并不代表的“位输入”方面的算法的复杂性。一个天真的推理错误。
英文摘要:
Paper is withdrawn. On review the paper contributes little of significance. The runtime analysis of the algorithms presented, while correct in terms of number of operations, does not represent the complexity of the algorithms in terms of "bits input". A naive mistake in reasoning.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。