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.
Issue
疑问、子问题和求助。把大问题拆成子 Issue;从任何一个 Issue 都能开出路线。
没有开放的 Issue
Issue 用来放疑问、子问题和求助。
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.
疑问、子问题和求助。把大问题拆成子 Issue;从任何一个 Issue 都能开出路线。
Issue 用来放疑问、子问题和求助。