Select an NP complete problem from the list below

$($or request approval for one not listed$)$

$.$ Implement a

solution programmatically to the problem.

You may choose to implement an exhaustive search or a

more efficient algorithm.

Choose a unit test that demonstrates the functionality of the solution algorithm you have chosen. Reduce the problem to another NP complete problem

:

Create a short presentation:

$1.$

Explain in detail the chosen NP complete problem.

$2.$

Reduce the chosen NP complete problem into another NP complete problem. Make sure you fully explain each step of the reduction.

$3.$

Be careful not to put too much on each slide.

$4.$

Source your reduction, you are not creating an original reduction.

There is no minimum length requirement for the slides and will vary depending on the NP complete problem$/$ reduction chosen.

The presentation slide format is selected as opposed to a

word$/$pdf document

;

however, the presentation will not be physically or virtually

presented. Some NP Complete Problems

:

$3$

$-$

Dimensional Matching Vertex Cover Clique Hamiltonian Circuit

Partition

Approved programming languages: Python

Hand$-$in:

$-$The code used to complete the task

$($no zip files$)$

$-$The output demonstrating thesolution tothe problem selected

$-$PowerPoint or keynote slides used for the presentation