arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.02709math.NT
收藏

球面上强逼近的复杂性

Complexity of strong approximation on the sphere

Naser T Sardari

摘要:

通过假设一些被广泛认为是算术代数,我们表明,接受一个数,是表示为$d\geq2$平方的总和受到给定的同余条件的任务是NP-完全的。另一方面,我们开发并实现了一个确定性的多项式时间算法,表示一个数为4平方和一些限制性的同余条件,通过假设一个多项式时间算法的因式分解整数和猜想~ \ref{cc}。作为一个应用程序,我们开发和实现了一个确定性的多项式时间算法导航LPS拉马努金图,在相同的假设。

英文摘要:

By assuming some widely-believed arithmetic conjectures, we show that the task of accepting a number that is representable as a sum of $d\geq2$ squares subjected to given congruence conditions is NP-complete. On the other hand, we develop and implement a deterministic polynomial-time algorithm that represents a number as a sum of 4 squares with some restricted congruence conditions, by assuming a polynomial-time algorithm for factoring integers and Conjecture~\ref{cc}. As an application, we develop and implement a deterministic polynomial-time algorithm for navigating LPS Ramanujan graphs, under the same assumptions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑