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 th

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 th Add to Reading List Source URL: ciim.usf.edu Download Document from Source Website File Size: 835,11 KB Share Document on Facebook