Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Homework Help: 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
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted