Abstract
A new simple algorithm which uses discrete Fourier transforms for breaking the general knapsack problem (also known as the subset sum problem) is presented along with the number of operations required for solving the problem. The method is applicable when the elements belong to a Galois field as well as that of a set of integers and is most effective for high-density knapsacks.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
