Re:Suits, Money Laundering, and Linear Programming
by JohnKemeny on Friday November 01, 2024 @10:40AM
(#42017352)
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.
Re:Suits, Money Laundering, and Linear Programming
by JadeNB on Friday November 01, 2024 @02:50PM
(#42020278)
Ah, 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.
What does this mean?