Sparse language

Known as: Sparse set 
In computational complexity theory, a sparse language is a formal language (a set of strings) such that the complexity function, counting the number… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2016
02419762016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Code-switching is prevalent among South African speakers, and presents a challenge to automatic speech recognition systems. It is… (More)
  • table 1
  • figure 1
  • table 4
  • table 3
  • table 6
Is this relevant?
2016
2016
This paper presents a comparison of classification methods for linguistic typology for the purpose of expanding an extensive, but… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 6
Is this relevant?
2007
2007
A language L 2 is said to be sparse if L contains a vanishingly small fraction of all possible strings of length n in. C. Ponder… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The philosopher David Hume’s conclusion that causal induction is solely based on observed associations still presents a puzzle to… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
In this paper we define a many-one reduction which is allowed to work in exponential time but may only output polynomially many… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A growing body of work demonstrates that syntactic structure can evolve in populations of genetically identical agents… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
This was the first year that the TDT program included a required crosslingual test: English and Mandarin. Most of our work… (More)
  • table 1
  • table 2
  • table 4
  • table 3
Is this relevant?
1994
1994
A language L E Z* is said to be sparse if L contains a vanishingly small fraction of all possible strings of length n in Z*. C… (More)
Is this relevant?
1993
1993
Ogiwara and Watanabe have recently shown that the hypothesis P not equal NP implies that no (polynomially) sparse language is… (More)
Is this relevant?
Highly Cited
1976
Highly Cited
1976
If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P @@@@ NP and if all… (More)
Is this relevant?