SelfComplementaryQ[g] yields True if graph g is self-complementary, meaning it is isomorphic to its complement.

StableMarriage[mpref, fpref] finds the male optimal stable marriage defined by lists of permutations describing male and female preferences.

TopologicalSort[g] gives a permutation of the vertices of the directed acyclic graph g such that an edge (i, j) implies that vertex i appears before vertex j.

TransitiveReduction[g] finds a smallest graph that has the same transitive closure as g.

UnionSet[a, b, s] merges the sets containing a and b in union-find data structure s.

DiracComb[x] represents the Dirac comb function giving a delta function at every integer point. DiracComb[x_1, x_2, ...] represents the multidimensional Dirac comb function.

FromCoefficientRules[list, {x_1, x_2, ...}] constructs a polynomial from a list of rules for exponent vectors and coefficients.

Version 6.0 continued Mathematica's commitment to delivering the latest and most efficient algorithms for linear algebra, generalized to arbitrary precision and with full ...

Mathematica 6.0 fundamentally redefined Mathematica and introduced a major new paradigm for computation. Building on Mathematica's time-tested core symbolic architecture, ...

CUDAFunctionLoad[src, fun, argtypes, blockdim] loads CUDAFunction from scr and makes fun available in Mathematica.CUDAFunctionLoad[{srcfile}, fun, argtypes, blockdim] loads ...