3-satisfiability

A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem

Bachelor's thesis: Solving the 3-SAT problem using quantum algorithms

solving Random 3-SAT(Boolean satisfiability problem) using Evolutionary algorithms like genetic algorithm.

Applying Meta-Heuristics and Evolutionary methods ( Genetic Algorithm, Particle Swarm Optimization ) on MAX-3-SAT problem.

a browser app that calculates the precise average and standard deviation of all the choices for the np-complete problems in polynomial time. It treats the problems as a thermal dynamic system and assign probabilities to witnesses using the Boltzmann distribution. The partition function is approximated using the entropy and a Taylor expansion.

computational intelligence, university of gdańsk 2019-2020

Segundo trabalho prático desenvolvido para a matéria de Algoritmos e Estruturas de Dados I, da Universidade Federal de Viçosa - campus Florestal.