| 单词 | Resolving Tree |
| 释义 | Resolving TreeA tree of Links obtained by repeatedly choosing a crossing, applying the Skein Relationship toobtain two simpler Links, and repeating the process. The Depth of a resolvingtree is the number of levels of links, not including the top. The Depth of the Link is theminimal depth for any resolving tree of that Link. |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。