superexponentially

superexponentially
In a superexponential manner

Wikipedia foundation.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… …   Wikipedia

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized …   Wikipedia

  • Polyhedral combinatorics — is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher dimensional convex polytopes.A key question in polyhedral combinatorics is to… …   Wikipedia

  • Neighborly polytope — In geometry and polyhedral combinatorics, a k neighborly polytope is a convex polytope in which every set of k or fewer vertices forms a face. For instance, a 2 neighborly polytope is a polytope in which every pair of vertices is connected by an… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”