First Page | Document Content | |
---|---|---|
Date: 1980-01-01 00:00:00 | The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although thAdd to Reading ListSource URL: ciim.usf.eduDownload Document from Source WebsiteFile Size: 835,11 KBShare Document on Facebook |