Перевод: с английского на русский

с русского на английский

complete packing

См. также в других словарях:

  • Packing problem — Part of a series on Puzzles …   Wikipedia

  • Set packing — is a classical NP complete problem in computational complexity theory and combinatorics, and was one of Karp s 21 NP complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… …   Wikipedia

  • Hallmark/Westland Meat Packing Company — is a California based meat packaging company.2008 recallOn February 17, 2008 Hallmark/Westland Meat Packing Company voluntarily recalled just over 143 million pounds (65 million kilograms) of raw and frozen beef products, considered the largest… …   Wikipedia

  • Strongly NP-complete — In computational complexity, strong NP completeness is a property of computational problems that is a special case of NP completeness. Ageneral computational problem may have numerical parameters. For example, the input to the Bin packing problem …   Wikipedia

  • Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane …   Wikipedia

  • List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …   Wikipedia

  • Karp's 21 NP-complete problems — One of the most important results in computational complexity theory was Stephen Cook s 1971 demonstration of the first (practically relevant) NP complete problem, the boolean satisfiability problem. [cite book|author = Stephen Cook|year =… …   Wikipedia

  • Atomic packing factor — Compacité (cristallographie) Pour les articles homonymes, voir Compacité. En cristallographie, la compacité (ou taux de remplissage) d un édifice cristallin, dans le modèle des sphères dures, est le rapport du volume total des sphères d une… …   Wikipédia en Français

  • combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

  • Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics       Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity.       Computer scientist Manindra Agrawal of the… …   Universalium

  • Kepler conjecture — In mathematics, the Kepler conjecture is a conjecture about sphere packing in three dimensional Euclidean space. It says that no arrangement of equally sized spheres filling space has a greater average density than that of the cubic close packing …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»