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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing Jg. 27; H. 4; S. 960 - 971
Hauptverfasser:	Shallcross, D. F., Pan, V. Y., Lin-Kriz, Y.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.08.1998
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!