Some necessary clarifications about the chords' problem and the partial digest problem

Authors:
A. Daurat;Y. Gérard;M. Nivat
Affiliations:
LSIIT, Pôle API, Boulevard Sébastien Brant, Illkirch, France;LLAIC, IUT, Ensemble Universitaire des Cézeaux, Aubière, France;LIAFA, Paris Cedex, France
Venue:
Theoretical Computer Science
Year:
2005

Citing 3
Cited 3

Reconstructing sets from interpoint distances (extended abstract)

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The chords' problem

Theoretical Computer Science
Sums, Projections, and Sections of Lattice Sets, and the Discrete Covariogram

Discrete & Computational Geometry

Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the complexity of constructing Golomb Rulers

Discrete Applied Mathematics
On the approximability of the Simplified Partial Digest Problem

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract

We state in previous paper [A. Daurat, Y. Gérard, M. Nivat, The chords' problem, Theoret. Comput. Sci. 282(2) (2002) 319-336] that the chords' problem can be solved in polynomial time. This result is however ambiguous and some people have been abused because the encoding of the data has not been given. The correctness of the result requires to specify the encoding of the data that we have used and to highlight the difference with the usual encoding implicitly considered in Partial Digest Problem.