Unverified50% confidenceFactExact time
Sugiyama算法第二步的最小化边交叉被证明是NP完全问题，由Garey和Johnson在1983年证明即使两层情况下最小化交叉数也是NP难的
1
Sources
50%
Confidence
Long-term
Relevance
8/14/2026
First Seen
Sources
Line9：自研布局引擎解决Mermaid图表渲染混乱问题
Related Claims
Unverified整数规划因引入离散变量而属于NP难问题，通常借助分支定界法求解66% similarUnverifiedHobbit的批次硬度问题本质上是NP难的，可归约为最大覆盖问题，作者用log-sum-exp项将其转化为可微光滑目标并证明具备梯度次模性64% similarUnverified整数规划（IP）因引入离散变量使解空间组合爆炸，属于NP难问题61% similarUnverifiedThe Sequential Minimal Optimization algorithm (SMO) was proposed by John Platt in 1998, decomposing large-scale quadratic programming problems into minimal sub-problems involving only two variables.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/746329API
curl https://kongchang.com/api/v1/knowledge/claims/746329MCP
get_claim(id=746329)