Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
fogof
on Oct 30, 2020
|
parent
|
context
|
favorite
| on:
An exponent one-fifth algorithm for deterministic ...
The abstract says "computes the prime factorisation of a positive integer N", so it's not your fault you were confused. The abstract should be corrected.
archgoon
on Oct 30, 2020
|
next
[–]
The abstract is correct. A positive integer N is log(N) bits long. If X = log(N), than a algorithm that runs in N^(1/5) will run in 2^(X/5) time.
anderskaseorg
on Oct 30, 2020
|
prev
[–]
There’s nothing wrong with the abstract as written. It makes no claim that the algorithm is polynomial-time.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
