Polynomial delay hybrid algorithms to enumerate candidate keys for a relation (Q6648284)
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: Polynomial delay hybrid algorithms to enumerate candidate keys for a relation |
scientific article; zbMATH DE number 7953894
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial delay hybrid algorithms to enumerate candidate keys for a relation |
scientific article; zbMATH DE number 7953894 |
Statements
Polynomial delay hybrid algorithms to enumerate candidate keys for a relation (English)
0 references
4 December 2024
0 references
candidate keys
0 references
minimal generators
0 references
enumeration problem
0 references
posets
0 references
0 references
