In computational complexity theory, a sparse language is a formal language (a set of strings) such that the complexity function, counting the numberâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Ewald van der Westhuizen, Thomas Niesler
- INTERSPEECH
- 2017

Code-switching is prevalent among South African speakers, and presents a challenge to automatic speech recognition systems. It isâ€¦Â (More)

Is this relevant?

2016

2016

- Reed Coke, Ben King, Dragomir R. Radev
- ArXiv
- 2016

This paper presents a comparison of classification methods for linguistic typology for the purpose of expanding an extensive, butâ€¦Â (More)

Is this relevant?

2007

2007

- Andrew Granvilley, Sheng Yu
- 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)

Is this relevant?

2004

2004

- Piotr Faliszewski
- Electronic Colloquium on Computational Complexity
- 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

- Henry Brighton
- Artificial Life
- 2002

A growing body of work demonstrates that syntactic structure can evolve in populations of genetically identical agentsâ€¦Â (More)

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)

Is this relevant?

1994

1994

- Per Enflo, Andrew Granville, Jeffrey Shallit, Sheng Yu
- Discrete Applied Mathematics
- 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

- Jack H. Lutz, Elvira Mayordomo
- STACS
- 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

- Juris Hartmanis, Leonard Berman
- STOC
- 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?