First of all, it's clear that EXACT 4SAT belongs to NP. The NP completeness of the latter is now proved by reducing the 3SAT to the EXACT 4ASAT. For an arbitrary 3SAT example, if a sentence contains the same word so many times, can be reduced to one, if both affirmative and negative is a variable, then the variable can be removed, then you can add some useless auxiliary variables in each clause, so you can the number of literals per clause contained in the expansion to four. This converts the 3SAT instance into a EXACT 4SAT problem
8.8
最新推荐文章于 2024-08-22 14:02:01 发布