1. Not finding help here? Sign up for a free 30min 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!

Proving that FSAT is FNP-complete

  1. Jan 2, 2006 #1
    I'm trying to prove that FSAT is FNP-complete and I could use a few hints.

    This is what I've gotten so far:

    Everything except for the last paragraph are just definitions almost word for word from our coursebook (Computational Complexity, Papadimitriou). What I'm having trouble with is the second point ie proving that there is a string function S for every language in FNP.
     
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you help with the solution or looking for help too?