This project implements the transformation of a 3-SAT instance to a CLIQUE instance, proving the NP-completeness of the CLIQUE problem.
In the docs folder you can find both a report and a presentation in Spanish with the proof in an elaborate theoretical form.
This is a student project for the subject Complejidad Computacional at University of La Laguna.
Sara Revilla Báez – @mizsrb
Alejandro León Fernández - @AlejandroLF
Javier Esteban Pérez Rivas