I'm trying to prove that FSAT is FNP-complete and I could use a few hints.(adsbygoogle = window.adsbygoogle || []).push({});

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. To show that FSAT is FNP-complete we must show that there are string functions R and S, computable in logarithmic space, such that for any strings x and z the following holds:

1) If x is an instance of a language A then R(x) is an instance of FSAT.

2) If z is a correct output of R(x), then S(z) is a correct output of x.

For 1) we can use any reduction that also works for SAT, since all we want is a Boolean expression. Since SAT is NP-complete there must exist such a reduction for every language A.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

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

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

**Physics Forums | Science Articles, Homework Help, Discussion**