{"version":"1.0","type":"link","title":"Sparse language - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}