Mathematics2025 · shared on Hacker News
A Formal Proof of Complexity Bounds on Diophantine Equations
Explore A Formal Proof of Complexity Bounds on Diophantine Equations, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Ybadmonster ·
A Formal Proof of Complexity Bounds on Diophantine Equations
93 points11 comments