 Problems related to the construction of Golomb Rulers are provably shown to be NP-hard, where it is also noted that no known NP-complete problem has similar flavor to finding Golomb Rulers.A set of integers formula_1 where formula_2 is a Golomb ruler if and only if

formula_3

The "order" of such a Golomb ruler is formula_4 and its "length" is formula_5.The canonical form has formula_6 and, if formula_7, formula_8.