It is not the case that Classical algorithms like GNFS may achieve subexponential (not full exponential) factorization, reducing the gap between quantum and classical time complexity.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.