can you transform a 3Sat problem to 4-CNF Sat?

Solved

Posted on 2011-05-03

This is a practice problem. I know that Sat, 3Sat is NP-complete. But how to show that 4-CNF Sat is also NP-complete?

8 Comments

By clicking you are agreeing to Experts Exchange's Terms of Use.

Title | # Comments | Views | Activity |
---|---|---|---|

How to honestly grant points to entries of music charts containing 20, 30, 40 ànd 50 tracks? | 33 | 107 | |

linearIn challenge | 23 | 54 | |

Order table with macro | 3 | 66 | |

pairs challenge | 5 | 29 |

Join the community of 500,000 technology professionals and ask your questions.

Connect with top rated Experts

**20** Experts available now in Live!