“NL-completeness”的概念、定义、翻译、参考文献-科学参考

单词	NL-completeness
释义	NL-completeness Encyclopedia 理学归约释 NL-completenessNL完全性 NL完全性刻画了非确定对数空间NL类中在对数空间归约下最难的一类问题。一个判定问题是非确定对数空间NL完全的，当且仅当它满足如下两个条件：①此问题能在非确定对数空间内求解，即它落在类内。②所有类里的问题都能在（确定）对数空间（见对数空间L类）内归约到此问题。
随便看	Nine Cantos nine categories of Chinese classical mathematics Nine Chamberlains Nine Chapter Law Nine Chapters Algorithmic Comparison Category Encyclopedia Nine Chapters of Han Code Nine Chapters on the Art of Mathematics nine circles theorem Nine-class feudal household asset hierarchy in Southern and Northern Dynasties nine classical needles nine-class tax system Nine Colored Deer nine combinations of reason Nine-Dragon Caves Scenic and Historic Area Nine-dragon Entrance on Stage nine factor model Nine General History of Institutions nine intersection model nine-j symbol nine keep nine kinds of preventions of archives Nine Laments Nine Lesser Chief Ministers nine-link lantern Nine Malawian Plays

科学参考收录了854744条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。