Complexity
101Average-case complexity — For deterministic algorithms, the average case complexity (expected time complexity), associates a given input distribution with the expected time of an algorithm.Leonid Levin presented the motivation for studying average case complexity as… …
102NC (complexity) — Unsolved problems in computer science Is NC = P ? In complexity theory, the class NC (for Nick s Class ) is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In… …
103Complete (complexity) — In computational complexity theory, a computational problem is complete for a complexity class if it is, in a formal sense, one of the hardest or most expressive problems in the complexity class. If a problem has the property that it allows you… …
104SNP (complexity) — In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical characterization in terms of graph theoretical properties. It forms the basis for the definition of the class… …
105Low-complexity art — was introduced by Jürgen Schmidhuber in 1997 [J. Schmidhuber. Low complexity art. Leonardo, Journal of the International Society for the Arts, Sciences, and Technology, 30(2):97–103, 1997. http://www.jstor.org/pss/1576418 ] . He characterizes it… …
106E (complexity) — In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)).E is less important to… …
107RL (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… …
108Social identity complexity — Social Identity Complexity: Who is We ? Given the recognition that individuals belong to multiple social groups, with multiple corresponding social identities, an important question to be addressed is how individuals combine these group… …
109Law of Complexity/Consciousness — The Law of Complexity/Consciousness is the tendency in matter to complexify upon itself and at the same time to increase in consciousness. The law was first formulated by Jesuit priest and paleontologist Pierre Teilhard de Chardin. Teilhard holds …
110List of complexity classes — This is a list of complexity classes in computational complexity theory. For other computational and complexity subjects, see list of computability and complexity topics.Many of these classes have a Co partner which consists of the complements of …
