008 - >to CNFSAT Q3 is indeed asking for an explicit...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Posted on 16 April 2009 14:08 >Dear Prof. Lam >In assignment 5 question 3, can I quote that 3D matching can be reduced >to ZOE (Dasgupta, p254) and then do ZOE -> CNFSAT? >Since CNFSAT is NP-complete, we all know that there >exists a polynomial time algorithm reducing 3d matching
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: >to CNFSAT. Q3 is indeed asking for an explicit algorithm to reduce 3d matching to cnfsat. Your approach can be accepted, but not a direct one and a clean one. I would suggest to the TA to deduct 20% for such an indirect approach. Tak...
View Full Document

This note was uploaded on 03/01/2010 for the course CS 1234 taught by Professor Chan during the Spring '10 term at University of the Bío-Bío.

Ask a homework question - tutors are online