EKOZ is based on a revolutionary approach to data handling and processing that was found by a computer scientist. This scientist has developed a set of tools to address a large range of problems with this approach, hence getting closer to the P = NP? legendary problem.

Most complexity theorists believe that P? NP. Perhaps this can be partly explained by the potentially stunning consequences of P = NP.

For a correct solution of the “P versus NP” question, the Clay Mathematics Institute will award a prize of $1.000.000.

EKOZ did not prove yet that P = NP. But we clearly obtain some extraordinary results on NP difficult problems like the N-SAT problem or the computation of a join.