Complexity
111SL (complexity) — In computational complexity theory, SL (Symmetric Logspace or Sym L) is the complexity class of problems log space reducible to USTCON ( undirected s t connectivity ), which is the problem of determining whether there exists a path between two… …
112Low (complexity) — In computational complexity theory, it is said that a complexity class B is low for a complexity class A if A B = A ; that is, A with an oracle for B is equal to A . Such a statement implies that an abstract machine which solves problems in A… …
113RE (complexity) — In computability theory and computational complexity theory, RE (recursively enumerable) is the class of decision problems for which a yes answer can be verified by a Turing machine in a finite amount of time.[1] Informally, it means that if the… …
114Certificate (complexity) — In computational complexity theory, a certificate (also called a witness) is a string that certifies the answer to a computation, or certifies the membership of some string in a language. A certificate is often thought of as a solution path… …
115International Society for Complexity, Information, and Design — The International Society for Complexity, Information, and Design (ISCID) is a non profit professional society devoted to promoting intelligent design. [http://www.aaas.org/spp/dser/03 Areas/evolution/issues/peerreview.shtml Intelligent Design… …
116PH (complexity) — In computational complexity theory, the complexity class PH is the union of all complexity classes in the polynomial hierarchy::mbox{PH} = igcup {kinmathbb{N Delta kmbox{P}PH was first defined by Larry Stockmeyer. It is contained in PPP (the… …
117NE (complexity) — In computational complexity theory, the complexity class NE is the set of decision problems that can be solved by a non deterministic Turing machine in time O(kn) for some k. NE, unlike the similar class NEXPTIME, is not closed under polynomial… …
118IP (complexity) — In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Goldwasser, et al. in 1985. An interactive proof system consists …
119Query (complexity) — In descriptive complexity, a query is a mapping from structures of one signature to structures of another vocabulary. Neil Immerman, in his book Descriptive Complexity , use[s] the concept of query as the fundamental paradigm of computation (p.… …
120Chain rule for Kolmogorov complexity — The chain rule for Kolmogorov complexity is an analogue of the chain rule for information entropy, which states: H(X,Y) = H(X) + H(Y | X) That is, the combined randomness of two sequences X and Y is the sum of the randomness of X plus whatever… …
