Unverified50% confidenceFactExact time
Solving the minimum dominating set is NP-hard on general graphs.
1
Sources
50%
Confidence
Long-term
Relevance
9/16/2026
First Seen
Sources
Related Entities
Related Claims
Unverified寻找非凸函数全局最优在一般情况下是NP-hard问题80% similarUnverifiedNP-hard problems are at least as hard as the hardest problems in NP.78% similarUnverified数独求解是NP完全问题，极难数独可能需要深层次的假设-回溯搜索74% similarUnverifiedOperation sequencing optimization is an instance of an NP-hard problem.72% similarUnverified0/1背包问题被证明是NP-hard的63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/924806API
curl https://kongchang.com/api/v1/knowledge/claims/924806MCP
get_claim(id=924806)