Approximation algorithmIn computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one. Approximation algorithms naturally arise in the field of theoretical computer science as a consequence of the widely believed P ≠ NP conjecture. Under this conjecture, a wide class of optimization problems cannot be solved exactly in polynomial time.
Problem solvingProblem solving is the process of achieving a goal by overcoming obstacles, a frequent part of most activities. Problems in need of solutions range from simple personal tasks (e.g. how to turn on an appliance) to complex issues in business and technical fields. The former is an example of simple problem solving (SPS) addressing one issue, whereas the latter is complex problem solving (CPS) with multiple interrelated obstacles.
Ringed spaceIn mathematics, a ringed space is a family of (commutative) rings parametrized by open subsets of a topological space together with ring homomorphisms that play roles of restrictions. Precisely, it is a topological space equipped with a sheaf of rings called a structure sheaf. It is an abstraction of the concept of the rings of continuous (scalar-valued) functions on open subsets. Among ringed spaces, especially important and prominent is a locally ringed space: a ringed space in which the analogy between the stalk at a point and the ring of germs of functions at a point is valid.
Parallelizable manifoldIn mathematics, a differentiable manifold of dimension n is called parallelizable if there exist smooth vector fields on the manifold, such that at every point of the tangent vectors provide a basis of the tangent space at . Equivalently, the tangent bundle is a trivial bundle, so that the associated principal bundle of linear frames has a global section on A particular choice of such a basis of vector fields on is called a parallelization (or an absolute parallelism) of .