subquadratic
Look at other dictionaries:
Subquadratic time — In computing an algorithm is said to run in subquadratic time if its running time f(n) is less then o(n^2). For example, most naïve sorting algorithms are quadratic (e.g., insertion sort), but more advanced algorithms can be found that are… … 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
3SUM — In computational complexity theory, 3SUM is the following computational problem conjectured to require roughly quadratic time::Given a set S of n integers, are there elements a , b , c in S such that a + b + c = 0?There is a simple algorithm to… … Wikipedia
Block Wiedemann algorithm — The Block Wiedemann algorithm for computing kernel vectors of a matrix over a finite field is a generalisation of an algorithm due to Don Coppersmith. Coppersmith s algorithm Let M be an n imes n square matrix over some finite field F, let x… … 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
List of computability and complexity topics — This is a list of computability and complexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with what can be computed, in principle. Computational complexity theory deals with how hard… … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
Computational complexity of mathematical operations — The following tables list the running time of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine.[1] See big O notation for an explanation … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Van Kampen diagram — In the mathematical area of geometric group theory, a van Kampen diagram is a planar diagram used to represent the fact that a particular word among the generators of a group given by a group presentation represents the identity element in that… … Wikipedia
