The NC Equivalence of Integer Linear Programming and Euclidean GCD

TitleThe NC Equivalence of Integer Linear Programming and Euclidean GCD
Publication TypeTechnical Report
Year of Publication1992
AuthorsPan, V.
Other Numbers746
Abstract

We show NC-reduction of integer linear programming with two variables to the evaluation of the remainder sequence arising in the application of the Euclidean algorithm to two positive integers. Due to the previous result of Deng, this implies NC-equivalence of both of these problems, whose membership in NC, as well as P-completeness, remain unresolved open problems.

URLhttp://www.icsi.berkeley.edu/pubs/techreports/tr-92-041.pdf
Bibliographic Notes

ICSI Technical Report TR-92-041

Abbreviated Authors

V. Pan

ICSI Publication Type

Technical Report