- bounded intersection
- мат. ограниченное пересечение
Большой англо-русский и русско-английский словарь. 2001.
bounded intersection
Смотреть что такое "bounded intersection" в других словарях:
Bounded variation — In mathematical analysis, a function of bounded variation refers to a real valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense. For a continuous function of a… … Wikipedia
Intersection graph — In the mathematical area of graph theory, an intersection graph is a graph that represents the pattern of intersections of a family of sets. Any graph may be represented as an intersection graph, but some important special classes of graphs may… … Wikipedia
Arrangement of hyperplanes — In geometry and combinatorics, an arrangement of hyperplanes is a finite set A of hyperplanes in a linear, affine, or projective space S . Questions about a hyperplane arrangement A generally concern geometrical, topological, or other properties… … Wikipedia
Glossary of topology — This is a glossary of some terms used in the branch of mathematics known as topology. Although there is no absolute distinction between different areas of topology, the focus here is on general topology. The following definitions are also… … Wikipedia
Neighborhoods in Columbus, Ohio — There are dozens of neighborhoods in Columbus, Ohio. Some are hard to define, as they encompass large areas developed at different times often with sub neighborhoods within them. Borders can also change based on popular understanding of the area … Wikipedia
Heine–Borel theorem — In the topology of metric spaces the Heine–Borel theorem, named after Eduard Heine and Émile Borel, states:For a subset S of Euclidean space R n , the following two statements are equivalent: * S is closed and bounded *every open cover of S has a … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
Convex polytope — A 3 dimensional convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n dimensional space Rn.[1] Some authors use the terms convex polytope and convex… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… … Wikipédia en Français
Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La … Wikipédia en Français
