- exponentially convex
- мат. экспоненциально выпуклый
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… … Wikipedia
Polyomino — The 18 one sided pentominoes, including 6 mirrored pairs … Wikipedia
Gamma function — For the gamma function of ordinals, see Veblen function. The gamma function along part of the real axis In mathematics, the gamma function (represented by the capital Greek letter Γ) is an extension of the factorial function, with its… … Wikipedia
Probability distribution — This article is about probability distribution. For generalized functions in mathematical analysis, see Distribution (mathematics). For other uses, see Distribution (disambiguation). In probability theory, a probability mass, probability density … Wikipedia
Context of computational complexity — In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, that a machine needs to solve a particular problem. Interpreting these metrics meaningfully requires… … 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
Airy function — This article is about the Airy special function. For the Airy stress function employed in solid mechanics, see Stress functions. In the physical sciences, the Airy function Ai(x) is a special function named after the British astronomer George… … Wikipedia
Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… … Wikipedia
microscope — /muy kreuh skohp /, n. 1. an optical instrument having a magnifying lens or a combination of lenses for inspecting objects too small to be seen or too small to be seen distinctly and in detail by the unaided eye. 2. (cap.) Astron. the… … Universalium
optimization — /op teuh meuh zay sheuhn/ 1. the fact of optimizing; making the best of anything. 2. the condition of being optimized. 3. Math. a mathematical technique for finding a maximum or minimum value of a function of several variables subject to a set of … Universalium
Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list … Wikipedia