Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Square_packing_in_a_square> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Square_packing_in_a_square abstract "Square packing in a square is a packing problem where the objective is to determine how many squares of side 1 (unit squares) can be packed into a square of side a. Obviously, if a is an integer, the answer is a2, but the precise, or even asymptotic, amount of wasted space for non-integer a is an open question.Proven minimum solutions:Other results: If it is possible to pack n2 − 2 unit squares in a square of side a, then a ≥ n. The naive approach in which all squares are parallel to the coordinate axes, and are placed touching edge-to-edge, leaves wasted space of less than 2a + 1. The wasted space of an optimal solution is asymptotically o(a7/11). All solutions must waste space at least Ω(a1/2) for some values of a. 11 unit squares cannot be packed in a square of side less than </sup>.".
- Square_packing_in_a_square thumbnail 5_kvadratoj_en_kvadrato.svg?width=300.
- Square_packing_in_a_square wikiPageID "31948840".
- Square_packing_in_a_square wikiPageRevisionID "586715807".
- Square_packing_in_a_square hasPhotoCollection Square_packing_in_a_square.
- Square_packing_in_a_square subject Category:Packing_problem.
- Square_packing_in_a_square type Abstraction100002137.
- Square_packing_in_a_square type Attribute100024264.
- Square_packing_in_a_square type Condition113920835.
- Square_packing_in_a_square type Difficulty114408086.
- Square_packing_in_a_square type MathematicalProblems.
- Square_packing_in_a_square type Problem114410605.
- Square_packing_in_a_square type State100024720.
- Square_packing_in_a_square comment "Square packing in a square is a packing problem where the objective is to determine how many squares of side 1 (unit squares) can be packed into a square of side a. Obviously, if a is an integer, the answer is a2, but the precise, or even asymptotic, amount of wasted space for non-integer a is an open question.Proven minimum solutions:Other results: If it is possible to pack n2 − 2 unit squares in a square of side a, then a ≥ n.".
- Square_packing_in_a_square label "Square packing in a square".
- Square_packing_in_a_square sameAs m.0gvrjzh.
- Square_packing_in_a_square sameAs Q7582076.
- Square_packing_in_a_square sameAs Q7582076.
- Square_packing_in_a_square sameAs Square_packing_in_a_square.
- Square_packing_in_a_square wasDerivedFrom Square_packing_in_a_square?oldid=586715807.
- Square_packing_in_a_square depiction 5_kvadratoj_en_kvadrato.svg.
- Square_packing_in_a_square isPrimaryTopicOf Square_packing_in_a_square.
