请输入您要查询的字词:
单词
NL-completeness
释义
NL-completeness
Encyclopedia
理学
归约
释
NL-completeness
NL完全性
NL完全性刻画了非确定对数空间NL类中在对数空间归约下最难的一类问题。一个判定问题是非确定对数空间NL完全的,当且仅当它满足如下两个条件:①此问题能在非确定对数空间内求解,即它落在类内。②所有类里的问题都能在(确定)对数空间(见对数空间L类)内归约到此问题。
随便看
unseen component
unseen matter
unselected marker
unseparated
unset
unsetting body
Unsettling Afternoon
unshaped refractories
unsharp masking
unsharp quantum logic
unshelled eggs
unshielded twisted pair
unshielded twisted pair, UTP
unsigned number
unsmeltable
unsmooth discharge
unsolicited distribution
unsolidified
unsolvability
unsolvability theorem
unsolvable
unsolvable algorithmic problem
unsolvable associative calculus
unsolvable decidability problem
unsolvable differential equations
科学参考收录了854744条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。
Copyright © 2000-2023 Sciref.net All Rights Reserved
京ICP备2021023879号
更新时间:2026/7/6 18:12:20