Related papers: A Polynomial Time Algorithm for a Special Case of …

Given a set of integers, one can easily construct the set of their pairwise distances. We consider the inverse problem: given a set of pairwise distances, find the integer set which realizes the pairwise distance set. This problem arises in…

The paper has been withdrawn.

The paper has been withdrawn by the author.

The paper has been withdrawn by the author.

In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed {\em n-fold integer programming problems} are polynomial time solvable. Our proof involves two heavy ingredients…

This paper has been withdrawn

This paper has been withdrawn by the author due to a mistake in the section 4.

This paper has been withdrawn by the author(s), due to the existence of a much better paper in http://arxiv.org/abs/cs.CR/0207027

This paper has been withdrawn, as it has been merged into arXiv:1009.6144

The article has been withdrawn by the author.

This paper has been withdrawn by the author, since some results of the paper have been already obtained in [J.~Lewandowski, Class. Quantum Grav. 9 (1992), no. 10, L147--L151.]

The paper is being withdrawn since the authors felt that the submission is a little premature after a careful reading by some of the experts in this field.

This paper has been withdrawn by the author. Proofs of two propositions need more details.

This paper has been withdrawn pending revision.

This paper has been withdrawn by the author, as it is now incorporated in 0901.4506 (v4)

This paper has been withdrawn by the authors.

This paper has been withdrawn by the author(s).The scheme presented is insecure.

This paper has been withdrawn by the author.

Due to a computational mistake this paper has been withdrawn.

This article has been withdrawn.