It is not the case that Polynomial-time reducibility is defined precisely to avoid hidden complexity: if A reduces to B in poly-time, solving B solves A without exponential blowup.
?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.