Classical algorithms like GNFS may achieve subexponential (not full exponential) factorization, reducing the gap between quantum and classical time complexity.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.