Search Results for ""

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

A triangle center is said to be polynomial iff there is a triangle center function f that is a polynomial in a, b, and c (Kimberling 1998, p. 46).

A polyomino is a generalization of the domino to a collection of n squares of equal size arranged with coincident sides. Polyominos were originally called "super-dominoes" by ...

A polyomino tiling is a tiling of the plane by specified types of polyominoes. Tiling by polyominoes has been investigated since at least the late 1950s, particularly by S. ...

A polyomino-like object made by attaching squares joined either at sides or corners. Because neighboring squares can be in relation to one another as kings may move on a ...

Polypons are polyforms obtained from dividing a regular triangular grid into 30-30-120 triangles, illustrated above. The numbers of polypons with n=1, 2, ... components are ...

Polyrects are polyforms obtained from a rectangular grid, illustrated above. The numbers of polyrects with n=1, 2, ... components are 1, 2, 3, 9, 21, 68, 208, ... (OEIS ...

Polyrhombs are polyforms obtained from a rhombic grid, illustrated above. The numbers of polyrhombs with n=1, 2, ... components are 1, 1, 3, 7, 20, 62, 204, ... (OEIS ...

Polysticks, sometimes also known as polyedges, are polyforms obtained from the edges of a regular grid. Square polysticks are polyforms obtained from the edges of a regular ...

Lachlan's terms for a collection of n points.