Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Jean Néraud (1990)

> Home

Details and statistics

DOI: 10.1051/ITA/1990240504591

access: closed

type: Journal Article

metadata version: 2020-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ita/Neraud90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/Neraud90
Jean Néraud:
Elementariness of a finite set of words is co-NP-complete. RAIRO Theor. Informatics Appl. 24: 459-470 (1990)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.