The complexity of finding SUBSEQ\((A)\) (Q839630)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of finding SUBSEQ\((A)\) |
scientific article; zbMATH DE number 5601527
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding SUBSEQ\((A)\) |
scientific article; zbMATH DE number 5601527 |
Statements
The complexity of finding SUBSEQ\((A)\) (English)
0 references
2 September 2009
0 references
automaton
0 references
automata theory
0 references
context-free language
0 references
context-free grammar
0 references
computability
0 references
turing degree
0 references
computational complexity
0 references
Higman's lemma
0 references
subsequence
0 references
bounded queries
0 references
unbounded search
0 references
recursive mathematics
0 references
reverse mathematics
0 references
0 references
0 references
0 references
0.86970985
0 references
0.86873424
0 references
0 references
0.8649446
0 references
0.86477613
0 references
0.85424054
0 references
0.8522806
0 references
0.8447409
0 references
