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

Withdrawn; replaced by longer, more detailed paper quant-ph/0010065.

This paper has been withdrawn because the result turns out to be trivial.

This paper has been withdrawn by the author.

This paper has been withdrawn by the author.

This paper was withdrawn by the authors.

This paper has been withdrawn

This paper has been withdrawn by the authors. There was an erroneous estimate of the degree of a transformed polynomial, making the method appear more effective than it really is. We thank an anonymous referee for pointing out this error.

This paper has been withdrawn by the author due to a mistake in the proof of the main theorem.

This paper was withdrawn on 20.11.97.

This article has been replaced by arXiv:0807.3093

This paper has been withdrawn.

This paper is withdrawn. See quant-ph/9806031 for a discussion.

This paper has been withdrawn by the author, since the author does not have enough time to answer every questions on this result.

This paper has been withdrawn by the authors.

This paper has been withdrawn by the author. This paper is now obsolete. For a solution please see: arXiv:/1205.4265.

The paper has been withdrawn.

This paper has been withdrawn by the author because it needs to be rewritten completely.

We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.

This paper has been withdrawn. See published paper http://arxiv.org/math.HO/0512390

This paper has been withdrawn by the author