scientific article; zbMATH DE number 742957

MaRDI QIDQ4763399zbMATH OpenFDO

Authors Yu Lin-Kriz, Victor Y. Pan

Publication date 11 April 1995

zbMATH Keywords

integer linear programmingparallel computational methods

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Linear programming (90C05) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Planar Integer Linear Programming is NC Equivalent to Euclidean GCD
• Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
• The iterated mod problem
• An improved parallel algorithm for integer GCD
• Two fast parallel GCD algorithms of many integers

Cited in

(2)

• The iterated mod problem
• Planar Integer Linear Programming is NC Equivalent to Euclidean GCD

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763399)