Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Efficient parallel algorithms
Parallel algorithmic techniques for combinatorial computation
Annual review of computer science: vol. 3, 1988
Information and Computation
On the parallel complexity of integer programming
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Parallel computational methods in integer linear programming
Parallel computational methods in integer linear programming
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
Journal of the ACM (JACM)
Parallel Sorting Algorithms
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Improved algorithms for integer programming and related lattice problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Mathematical programming: complexity and applications
Mathematical programming: complexity and applications
| Hi-index | 0.00 |
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 computing the output of an iterated modulo function, with the remainder sequence from the Euclidean algorithm (that is, with the continued fraction expansion of a rational number) as its input arguments. The best previously known results are special cases of our theorem.