Related papers: A Polynomial Time Algorithm for a Special Case of …
This paper has been retracted, for obvious reasons.
This paper has been temporarily withdrawn by the author(s),
This paper has been withdrawn by the author due to text overlap with arXiv:1102.5004, as well as omission of proper citations to arXiv:1110.4655 and arXiv:1111.0313
This paper has been withdrawn by the author(s). Please refer to quant-ph/0311171.
We propose a simple O([n^5/\log n]L) algorithm for linear programming feasibility, that can be considered as a polynomial-time implementation of the relaxation method. Our work draws from Chubanov's "Divide-and-Conquer" algorithm [4], where…
This paper has been withdrawn by the author.
This paper has been withdrawn because there is a fundamental error in the computations; with the right computational scheme it seems to be just a version of the Jones polynomial
This paper has been withdrawn.
This paper has been withdrawn.
This article has been withdrawn.
This paper has been withdrawn due to an error, and no further revisions will be made.
This paper has been withdrawn.
This paper has been withdrawn.
This paper has been withdrawn by the authour.
This paper has been withdrawn by the author(s), due a crucial error on the entanglement of $\Gamma$ registers.
This paper has been withdrawn.
This paper has been withdrawn.
This paper has been withdrawn
Integer linear programs $\min\{c^T x : A x = b, x \in \mathbb{Z}^n_{\ge 0}\}$, where $A \in \mathbb{Z}^{m \times n}$, $b \in \mathbb{Z}^m$, and $c \in \mathbb{Z}^n$, can be solved in pseudopolynomial time for any fixed number of constraints…
This paper has been withdrawn