#### Filter Results:

#### Publication Year

1992

1998

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

It is not known if planar integer linear programming is P-complete or if it is in NC, and the same can be said about the computation of the remainder sequence of the Euclidean algorithm applied to two integers. However, both computations are NC equivalent. The latter computational problem was reduced in NC to the former one by Deng [Mathematical… (More)

We study parallel computational methods for integer linear programming problem with two variables. Applying several novel techniques, we prove that this problem is NC-equivalent to computing the continued fraction expansion of a rational number, that is, to computing all the intermediate remainders in the Euclidean algorithm applied to two integers, plus to… (More)

- ‹
- 1
- ›