A simple search problem is studied in which a binary n-tuple is to be found in a list, by sequential bit comparisons with cost. The problem can be solved (for small n) using dynamic programming. We show how the “bottom up” part of the algorithm can be organized by means of Formal Concept Analysis.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:89285 |
| Date | 19 March 2024 |
| Creators | Ganter, Bernhard |
| Publisher | Springer Science + Business Media B.V |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 1573-7470, 10.1007/s10472-022-09826-x |
Page generated in 0.0023 seconds