The dimensions in which the kissing number is known are listed in boldface. The kissing number problem can be generalized to the problem of finding the maximum number of non-overlapping congruent copies of any convex body that touch a given copy of the body. There are different versions of the problem depending on whether the copies are only required to be congruent to the original body, translates of the original body, or translated by a lattice. For the regular tetrahedron, for example, it is known that both the lattice kissing number and the translative kissing number are equal to 18, whereas the congruent kissing number is at least 56. There are several approximation algorithms on intersection graphs where the approximation ratio depends on the kissing number. For example, there is  a polynomial-time 10-approximation algorithm to find a maximum non-intersecting subset of a set of rotated unit squares. The kissing number problem can be stated as the existence of a solution to a set of inequalities. Let formula_1 be a set of "N" "D"-dimensional position vectors of the centres of the spheres. The condition that this set of spheres can lie round the centre sphere without overlapping is:  Thus the problem for each dimension can be expressed in the existential theory of the reals. However, general methods of solving problems in this form take at least exponential time which is why this problem has only been solved up to four dimensions. By adding additional variables, formula_6 this can be converted to a single quartic equation in "N"("N"-1)/2 + "DN" variables:  Therefore, to solve the case in "D" = 5 dimensions and "N" = 40 + 1 vectors would be equivalent to determining the existence of real solutions to a quartic polynomial in 1025 variables. For the "D" = 24 dimensions and "N" = 196560 + 1, the quartic would have 19,322,732,544 variables. An alternative statement in terms of distance geometry is given by the distances squared formula_10 between then "m"th and "n"th sphere. This must be supplemented with the condition that the Cayley–Menger determinant is zero for any set of points which forms an ("D" + 1) simplex in "D" dimensions, since that volume must be zero. Setting formula_12 gives a set of simultaneous polynomial equations in just "y" which must be solved for real values only.