In differential geometry, the fundamental theorem of space curves states that every regular curve in three-dimensional space, with non-zero curvature, has its shape (and size) completely determined by its curvature and torsion.
Given curvature and torsion , the Frenet equation relates the tangent, normal, and binormal vector of the curve at each position.
I have coded recently the simplex algorithm. It is an algorithm that solves the optimizations of a problem of linear programming. It gives a function to minimize and constrains the variables with an inequality form.
It can be proven that the simplex algorithm solves this problem in Non-Polynomial time.