加入
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.
Update from the catalog #1
已合并
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.