Re:A Formal Proof of Complexity Bounds on Diophantine Equations
by throwaway81523 on Friday May 23, 2025 @09:02PM
(#44078001)
That sounds like the coefficients might have to be arbitrarily large. Otherwise all DE's could reduce to a finite set of them, impossible via the MRDP theorem. So it's not so easy to call that bounded complexity.
[ Parent
| on HN ]
There are no comments on this comment yet.