An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem

This paper describes a new approach for solving the subset-sum problem. It is useful for solving other NP-hard problems. The limits and potential of this approach are discussed. The approach yields an algorithm for solving the dense version of the subset-sum problem. It runs in time $O(\ell \log \el...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing Jg. 20; H. 6; S. 1157 - 1189
Hauptverfasser:	Galil, Zvi, Margalit, Oded
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1991
Schlagworte:	Algorithms Approximation Classical combinatorial problems Combinatorics Combinatorics. Ordered structures Computer science Dynamic programming Exact sciences and technology Integer programming Mathematics Sciences and techniques of general use Integer Integer programming Partition Algorithm complexity NP hard problem Combinatory problem Progression arithmétique
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!