It is not the case that Cook's theorem establishes NP-completeness under polynomial-time many-one reductions, but Buss's bounded arithmetic formalizes this within systems of varying proof-theoretic strength.
?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.