Unverified50% confidenceFactExact time
QAP has been proven to be NP-hard, and even instances of size n=30 can be intractable for exact solving algorithms.
1
Sources
50%
Confidence
Long-term
Relevance
10/8/2026
First Seen
Sources
Related Entities
Related Claims
Unverified整数规划因引入离散变量而属于NP难问题，通常借助分支定界法求解70% similarUnverifiedPCB布局（Placement）本质上是一个NP难的组合优化问题67% similarUnverifiedMulti-Agent Pathfinding (MAPF) has been proven to be an NP-hard problem.66% similarUnverifiedMisrouting sends complex requests to small models with insufficient capability, producing answers that appear plausible but are actually incorrect, and the cost of this quality degradation is difficult to quantify.64% similarUnverified整数规划（IP）因引入离散变量使解空间组合爆炸，属于NP难问题63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/987071API
curl https://kongchang.com/api/v1/knowledge/claims/987071MCP
get_claim(id=987071)