On the complexity of finding the set of candidate keys for a given set of functional dependencies (Q1229752)
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: On the complexity of finding the set of candidate keys for a given set of functional dependencies |
scientific article; zbMATH DE number 3526288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding the set of candidate keys for a given set of functional dependencies |
scientific article; zbMATH DE number 3526288 |
Statements
On the complexity of finding the set of candidate keys for a given set of functional dependencies (English)
0 references
1976
0 references
