3 ms·
Weak NP-completeness is problems that are numeric in nature and that become polynomial time solvable if the encoding of the numbers are given in unary. https:/
by JohnKemeny 2y ago
Weak NP-completeness is problems that are numeric in nature and that become polynomial time solvable if the encoding of the numbers are given in unary.
https://en.wikipedia.org/wiki/Weak_NP-completeness https://en.wikipedia.org/wiki/Weak_NP-completeness
- JadeNB 2y agoAh, thanks. Then, since "NP-hard" and "NP-complete" are different, I would expect "weakly NP-hard" and "weakly NP-complete" to be different; but, at least according to Wikipedia, they are synonymous.