Login / Signup

Elementariness of a finite set of words is co-NP-complete.

Jean Néraud
Published in: RAIRO Theor. Informatics Appl. (1990)
Keyphrases
  • np complete
  • database
  • small number
  • randomly generated
  • data sets
  • n gram
  • finite number
  • polynomial time complexity