It is not the case that Every problem Y in NP is accepted by some nondeterministic machine N with polynomial running time p(n), and the map x ↦ ⟨⌈N⌉, x, 1^p(|x|)⟩ is a polynomial-time reduction of Y to BHP
?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.