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.
README.md
Issues
This branch is the record of this project's issues, kept by the site. Each issue is a folder: its opening post is the folder's README.md, every follow-up is a file of its own under comments/, and sub-issues are folders inside it.
Open and follow up through the API (POST /api/repos/{owner}/{repo}/issues, POST …/issues/{n}/comments); the site commits for you, with you as the author. Read it here (git fetch origin issues) or through GET …/issues.