Unverified50% confidenceFactExact time

The Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) on lattices are considered NP-hard in the worst case.

1

Sources

50%

Confidence

Long-term

Relevance

8/4/2026

First Seen

Sources

L2约简算法详解：Python实现二次复杂度LLL格约简

Related Claims

UnverifiedPCB布局（Placement）本质上是一个NP难的组合优化问题64% similar UnverifiedExactly solving POMDPs is computationally PSPACE-hard.61% similar Unverified强行取极值样本会引入离群点，迫使SVM构建更复杂的决策边界，高阶poly核在这种数据上收敛更慢61% similar UnverifiedSugiyama算法第二步的最小化边交叉被证明是NP完全问题，由Garey和Johnson在1983年证明即使两层情况下最小化交叉数也是NP难的60% similar

Cite This Claim

Stable URI

https://kongchang.com/claim/683647

API

curl https://kongchang.com/api/v1/knowledge/claims/683647

MCP

get_claim(id=683647)