decomposable polynomial

  • 1Knot theory — A three dimensional depiction of a thickened trefoil knot, the simplest non trivial knot …

    Wikipedia

  • 2List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …

    Wikipedia

  • 3Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …

    Википедия

  • 4Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …

    Википедия

  • 5Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… …

    Wikipedia

  • 6Chordal graph — A cycle (black) with two chords (green). As for this part, the graph is chordal. However, removing one green edge would result in a non chordal graph. Indeed, the other green edge with three black edges would form a cycle of length four with no… …

    Wikipedia

  • 7Normal distribution — This article is about the univariate normal distribution. For normally distributed vectors, see Multivariate normal distribution. Probability density function The red line is the standard normal distribution Cumulative distribution function …

    Wikipedia

  • 8Structure theorem for finitely generated modules over a principal ideal domain — In mathematics, in the field of abstract algebra, the structure theorem for finitely generated modules over a principal ideal domain is a generalization of the fundamental theorem of finitely generated abelian groups and roughly states that… …

    Wikipedia

  • 9Dynamization — In computer science, Dynamization is the process of transforming a static data structure into a dynamic one. Although static data structures may provide very good functionality and fast queries, their utility is limited because of their inability …

    Wikipedia

  • 10Steenrod algebra — In algebraic topology, a branch of mathematics, the Steenrod algebra is a structure occurring in the theory of cohomology operations. It is an object of great importance, most especially to homotopy theorists. More precisely, for a given prime… …

    Wikipedia