搜索结果: 1-1 共查到“数学 approximate categories”相关记录1条 . 查询时间(0.128 秒)
The Graph Isomorphism Problem and approximate categories
Graph Isomorphism Problem approximate categories
font style='font-size:12px;'>
2011/1/20
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm.