Planar Integer Linear Programming is NC Equivalent to Euclidean GCD

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 reduce...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	SIAM journal on computing Ročník 27; číslo 4; s. 960 - 971
Hlavní autori:	Shallcross, D. F., Pan, V. Y., Lin-Kriz, Y.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.08.1998
Predmet:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science Computer science; control theory; systems Exact sciences and technology Integer programming Linear algebra Linear programming Mathematical programming Operational research and scientific management Operational research. Management science Theoretical computing Integer programming Linear programming Parallel algorithms Computational complexity Algorithm complexity Program complexity
ISSN:	0097-5397, 1095-7111
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!