1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

P vs NP undecidable consequences

  1. Oct 9, 2014 #1
    I don't understand why if P vs NP can't be decided in ZFC, then there exist "near" polynomial time algorithms for NP. How would that possibly work?
  2. jcsd
  3. Oct 9, 2014 #2
    A solution to one of the NP-complete problems, whose proof would involve some other formal language (say, if one found a polynomial time solution to the subset sum problem using number theory or algebra), and then reducing all the other problems to this solution might work.
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook