An almost linear-time algorithm for the dense subset-sum problem

Authors:
Zvi Galil;Oded Margalit
Affiliations:
Columbia Univ., New York, NY/ and Tel Aviv Univ., Tel Aviv, Israel;Tel Aviv Univ., Tel Aviv, Israel
Venue:
SIAM Journal on Computing
Year:
1991

Citing 0
Cited 2

Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Solving medium-density subset sum problems in expected polynomial time

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract