Planar Integer Linear Programming is NC Equivalent to Euclidean GCD (Q4210079)
From MaRDI portal
scientific article; zbMATH DE number 1200711
Language | Label | Description | Also known as |
---|---|---|---|
English | Planar Integer Linear Programming is NC Equivalent to Euclidean GCD |
scientific article; zbMATH DE number 1200711 |
Statements
Planar Integer Linear Programming is NC Equivalent to Euclidean GCD (English)
0 references
20 September 1998
0 references
integer linear programming
0 references
Euclidean algorithm
0 references
greatest common divisor
0 references
parallel computational complexity
0 references