Solvable
61Descriptive complexity theory — For other uses, see Kolmogorov complexity. Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic needed to express the languages in them. For… …
62Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …
63Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …
64Solved game — A two player game can be solved on several levels: [V. Allis, Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of ComputerScience, University of Limburg, 1994. Online:… …
65Nilpotent group — Concepts in group theory category of groups subgroups, normal subgroups group homomorphisms, kernel, image, quotient direct product, direct sum semidirect product, wreath product …
66Geometrization conjecture — Thurston s geometrization conjecture states that compact 3 manifolds can be decomposed canonically into submanifolds that have geometric structures. The geometrization conjecture is an analogue for 3 manifolds of the uniformization theorem for… …
67Cousin problems — In mathematics, the Cousin problems are two questions in several complex variables, concerning the existence of meromorphic functions that are specified in terms of local data. They were introduced in special cases by P. Cousin in 1895. They are… …
68P (complexity) — In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems which can be solved by a deterministic Turing machine using a polynomial amount of… …
69Polynomial hierarchy — In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial …
70RL (complexity) — In computational complexity theory, RL (Randomized Logarithmic space),[1] sometimes called RLP (Randomized Logarithmic space Polynomial time),[2] is the complexity class of problems solvable in logarithmic space and polynomial time with… …
