Sparse language
In computational complexity theory, a sparse language is a formal language (a set of strings) such that the complexity function, counting 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.
Wikipage disambiguates
Wikipage redirect
primaryTopic
Sparse language
In computational complexity theory, a sparse language is a formal language (a set of strings) such that the complexity function, counting 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.
has abstract
Em teoria da complexidade comp ...... agem, que é delimitada por nk.
@pt
En théorie de la complexité, u ...... 0, quand n tend vers l'infini.
@fr
In computational complexity th ...... guage, which is bounded by nk.
@en
在計算複雜性理論裡面, 稀疏語言是一種形式語言 (一堆字串的 ...... n, 這個語言僅包含個字串, 而這個數字則被 nk給限制住。
@zh
Link from a Wikipage to an external page
Wikipage page ID
12,769,596
page length (characters) of wiki page
Wikipage revision ID
701,995,527
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Em teoria da complexidade comp ...... parsas são chamadas de SPARSE.
@pt
En théorie de la complexité, u ...... 0, quand n tend vers l'infini.
@fr
In computational complexity th ...... se languages is called SPARSE.
@en
在計算複雜性理論裡面, 稀疏語言是一種形式語言 (一堆字串的 ...... n, 這個語言僅包含個字串, 而這個數字則被 nk給限制住。
@zh
label
Langage creux
@fr
Linguagem esparsa
@pt
Sparse language
@en
稀疏語言
@zh