[HN Gopher] An exponent one-fifth algorithm for deterministic in... ___________________________________________________________________ An exponent one-fifth algorithm for deterministic integer factorisation Author : oxxoxoxooo Score : 11 points Date : 2020-10-29 22:30 UTC (30 minutes ago) (HTM) web link (arxiv.org) (TXT) w3m dump (arxiv.org) | Sniffnoy wrote: | Note that what makes this notable is that the time bound is | _proven_ (according to the paper, anyway). N^1 /5 is much slower | than we normally think of GNFS as being, but the thing to note is | that GNFS isn't actually _proven_ to run that fast. | jepler wrote: | Sounds like GNFS is still better if you believe its conjectured | computational complexity, but this still seems like a good | advance. Paper's over my head for 10 minutes reading though. ___________________________________________________________________ (page generated 2020-10-29 23:00 UTC)