Unverified50% confidenceFactExact time
BVH（层次包围盒）加速结构可使点到复杂几何表面的最近距离查询在O(log n)时间内完成，n为几何面片数
1
Sources
50%
Confidence
Long-term
Relevance
8/4/2026
First Seen
Sources
分解子域行走：加速蒙特卡洛PDE求解的免网格新方法
Related Claims
UnverifiedKruskal算法将所有边按权重排序后依次加入不形成环的边，底层依赖并查集，时间复杂度为O(E log E)68% similarUnverified多智能体并行架构本质上是将链式推理拆解为有向无环图（DAG）式任务调度，可将整体完成时间从O(n)降至接近O(max_subtask)62% similarUnverifiedinaturalist-clumper的聚合算法借鉴了轨迹分析中的停留点检测思想，按时间排序遍历观察记录，使用Haversine公式计算地理距离60% similarUnverifiedBoth Dify and n8n use directed acyclic graph (DAG) structures at their core to describe task dependencies, while ComfyUI allows cyclic nodes to support iterative optimization workflows.59% similarUnverified背包问题存在完全多项式时间近似方案FPTAS，可在任意精度ε下以O(n³/ε)的时间给出(1-ε)近似解58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/685473API
curl https://kongchang.com/api/v1/knowledge/claims/685473MCP
get_claim(id=685473)