/TP_PAA_Clique_SAT_Conjunto_Independente_Problemas_NP

Implementation of three fundamental algorithms in graph theory and Boolean logic: Satisfiability (SAT), Clique, and Independent Set. Each problem is addressed using various optimization and search techniques.

Primary LanguagePython

Watchers