Skip to content

Algorithms

Generic algorithms for Julia.

Resources

Sorting

Wikipedia: Sorting algorithm

NP-complete Problems

Wikipedia: NP-complete problems cannot be solved in polynomial time complexity and often have to be inexactly solved using heuristics.

Traveling salesman problem

Wikipedia: Traveling salesman problem

Boolean satisfiability problem (SAT)

Wikipedia: SAT is a kind of NP-complete (NPC) problems.

Genetic algorithm

Wikipedia: Genetic algorithm. See also the optimization section.

Homomorphic encryption

Wikipedia: Homomorphic encryption