Delete comment from: Computational Complexity

Lance Fortnow said...

You don't have to focus on the first bit. You get the same Q' if you use any other bit, or any polynomial-time time computable function of the witness. Q' implies that P = NP intersect co-NP so you already get factoring and discrete log as a consequence.

Dec 13, 2018, 4:23:26 PM

Posted to Inverting Onto Functions