Aaronson and others in computational complexity theory distinguish between polynomial-time equivalence and step-by-step procedural comparability, which the claim conflates.
?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.