- polynomial scheme
- мат. полиномиальная схема
Большой англо-русский и русско-английский словарь. 2001.
polynomial scheme
Смотреть что такое "polynomial scheme" в других словарях:
Polynomial-time approximation scheme — In computer science, a polynomial time approximation scheme (abbreviated PTAS) is a type of approximation algorithm for optimization problems (most often, NP hard optimization problems).A PTAS is an algorithm which takes an instance of an… … Wikipedia
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Scheme (mathematics) — In mathematics, a scheme is an important concept connecting the fields of algebraic geometry, commutative algebra and number theory. Schemes were introduced by Alexander Grothendieck so as to broaden the notion of algebraic variety; some consider … Wikipedia
Horner scheme — In numerical analysis, the Horner scheme or Horner algorithm, named after William George Horner, is an algorithm for the efficient evaluation of polynomials in monomial form. Horner s method describes a manual process by which one may approximate … Wikipedia
Hilbert scheme — In algebraic geometry, a branch of mathematics, a Hilbert scheme is a scheme that is the parameter space for the closed subschemes of some projective space (or a more general scheme), refining the Chow variety. The Hilbert scheme is a disjoint… … Wikipedia
Threshold shadow scheme — A threshold shadow scheme (also known as a threshold signature scheme or secret sharing ) is a form of secure multiparty computation in which a message is shared between several (N) people. Any piece of the message on its own is totally… … Wikipedia
Estrin's scheme — In numerical analysis Estrin s scheme (also known as Estrin s method) is an algorithm for numerical evaluation of polynomials. The Horner scheme for evaluation of polynomials is one of the most commonly used algorithms for this purpose and unlike … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
List of polynomial topics — This is a list of polynomial topics, by Wikipedia page. See also trigonometric polynomial, list of algebraic geometry topics.Basics*Polynomial *Coefficient *Monomial *Polynomial long division *Polynomial factorization *Rational function *Partial… … Wikipedia
Macdonald polynomial — In mathematics, Macdonald polynomials P λ are a two parameter family of orthogonal polynomials indexed by a positive weight λ of a root system, introduced by Ian G. Macdonald (1987). They generalize several other families of orthogonal… … Wikipedia
