Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00311120n
Noun Concept
Categories: 計算複雜性理論
ZH
完備  完備
ZH
在計算複雜性理論內，一個計算問題（computational problem）對一個複雜度類是完備或者完全的，用比較不正式的解釋，是說這問題在此複雜度類裡面是一個「最難的」或者「最代表性的」題目。 Wikipedia
English:
complexity
Definitions
Relations
Sources
ZH
在計算複雜性理論內，一個計算問題（computational problem）對一個複雜度類是完備或者完全的，用比較不正式的解釋，是說這問題在此複雜度類裡面是一個「最難的」或者「最代表性的」題目。 Wikipedia
IS A
复杂性类
FACET OF
計算複雜性理論
Wikipedia
ZH
完備 (複雜度)
Wikidata
ZH
完備 (複雜度)
Wikipedia Translations
ZH
完整

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License