subexponential
Look at other dictionaries:
Heavy-tailed distribution — In probability theory, heavy tailed distributions are probability distributions whose tails are not exponentially bounded:cite book |author=Asmussen, Søren |title=Applied probability and queues |publisher=Springer |location=Berlin |year=2003… … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
Big O notation — In mathematics, big O notation is used to describe the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. It is a member of a larger family of notations that is… … Wikipedia
Growth rate (group theory) — In group theory, the growth rate of a group with respect to a symmetric generating set describes the size of balls in the group. Every element in the group can be written as a product of generators, and the growth rate counts the number of… … Wikipedia
Clique-sum — A clique sum of two planar graphs and the Wagner graph, forming a K5 free graph. In graph theory, a branch of mathematics, a clique sum is a way of combining two graphs by gluing them together at a clique, analogous to the connected sum operation … Wikipedia
Gil Kalai — is the Henry and Manya Noskwith Professor of Mathematics at the Hebrew University of Jerusalem, an adjunct professor of mathematics and of computer science at Yale University, and the editor of the Israel Journal of Mathematics . He received his… … Wikipedia
Vertex cover — In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical… … Wikipedia
Dehn function — In the mathematical subject of geometric group theory, a Dehn function, named after Max Dehn, is an optimal function associated to a finite group presentation which bounds the area of a relation in that group (that is a freely reduced word in the … Wikipedia
BPP — In complexity theory, BPP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of at most 1/3 for all instances. The abbreviation BPP refers to Bounded error, Probabilistic,… … Wikipedia
