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

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on computing Vol. 20; no. 6; pp. 1157 - 1189
Main Authors:	Galil, Zvi, Margalit, Oded
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1991
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!