Prolog to On the Complexity of the Verification of the Costas Property

  • Jim Esch
  • Published 2009 in Proceedings of the IEEE

Abstract

| In this paper, we show that in order to ascertain whether a permutation has the Costas property, only a restricted subset among the totality of pairs of entries in the same row of the difference triangle needs to be checked, and we explicitly describe such a subset. This represents a further refinement on the definition of a Costas permutation. This observation can be used to speed up algorithms that exhaustively search for Costas permutations. Asymptotically, the savings approaches 43% for large orders when compared with the previous standard efficient method.

DOI: 10.1109/JPROC.2008.2011946

4 Figures and Tables

Cite this paper

@article{Esch2009PrologTO, title={Prolog to On the Complexity of the Verification of the Costas Property}, author={Jim Esch}, journal={Proceedings of the IEEE}, year={2009}, volume={97}, pages={586-593} }