Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Document Date: 1980-01-01 00:00:00
Open Document
File Size: 835,11 KB
Share Result on Facebook
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