Planar Integer Linear Programming is NC Equivalent to Euclidean GCD (Q4210079)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Planar Integer Linear Programming is NC Equivalent to Euclidean GCD |
scientific article; zbMATH DE number 1200711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.739487886428833
0 references
0.7155937552452087
0 references
0.7028838396072388
0 references
