The chords' problem

Authors:
Alain Daurat;Yan Gérard;Maurice Nivat
Affiliations:
Laboratoire de Logique et d'Informatique de Clermontl (LLAICl), IUT, Département d'Informatique, Ensemble Universitaire des Cézeaux, B.P. 86, F-63172 Aubière Cedex, France;Laboratoire de Logique et d'Informatique de Clermontl (LLAICl), IUT, Département d'Informatique, Ensemble Universitaire des Cézeaux, B.P. 86, F-63172 Aubière Cedex, France;Laboratoire d'Informatique, Algorithmique, Fondements et Applications. (LIAFA), Université Denis Diderot, Case 7014-2, place Jussieu F-75251 Paris Cedex 05, France
Venue:
Theoretical Computer Science
Year:
2002

Citing 3
Cited 3

Reconstructing sets from interpoint distances (extended abstract)

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Multiplicities of interpoint distances in finite planar sets

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Intervertex distances in convex polygons

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)

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

Theoretical Computer Science
On the complexity of constructing Golomb Rulers

Discrete Applied Mathematics
The complexity of minimum difference cover

Journal of Discrete Algorithms

Quantified Score

Hi-index	5.24

Visualization

Abstract

Computability and complexity are the two major lines along which the science of algorithms has evolved; but the same concepts guide many human activities. We try to catch some glimpses of the connections between these two worlds, to meet the expectations ...