加入
The sum of square roots problem
Bound how close two sums of k square roots of integers up to n can be, and decide whether such sums can be compared in polynomial time.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
新建 PR
Bound how close two sums of k square roots of integers up to n can be, and decide whether such sums can be compared in polynomial time.
PR 把工作从一条路线带到另一条；合并它就是采纳。