A linear time algorithm for monadic querying of indefinite data over linearly ordered domains (Q1887153)
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: A linear time algorithm for monadic querying of indefinite data over linearly ordered domains |
scientific article; zbMATH DE number 2118418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for monadic querying of indefinite data over linearly ordered domains |
scientific article; zbMATH DE number 2118418 |
Statements
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains (English)
0 references
23 November 2004
0 references
Well-quasi-ordering
0 references
Higman's lemma
0 references
Indefinite data
0 references
Query answering
0 references
Linear-time algorithm
0 references
0.758569598197937
0 references
0.758569598197937
0 references
0.6958954334259033
0 references
