Information | |
---|---|
has gloss | eng: In computational complexity theory, a sparse language is a formal language (a set of strings) such that the number of strings of length n in the language is bounded by a polynomial function of n. They are used primarily in the study of the relationship of the complexity class NP with other classes. The complexity class of all sparse languages is called SPARSE. |
lexicalization | eng: sparse language |
instance of | e/Formal language |
Meaning | |
---|---|
Chinese | |
has gloss | zho: 在計算複雜性理論裡面, 稀疏語言是一種形式語言 (一堆字串的集合字串),並且這語言內長度為n的字串個數,被一個n的多項式所限制住。 這種語言主要被用來研究NP這類語言與其他種類語言的關係。包含所有稀疏語言的複雜度類被稱作SPARSE。 |
lexicalization | zho: 稀疏語言 |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint