On the complexity of finding the set of candidate keys for a given set of functional dependencies (Q1229752)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding the set of candidate keys for a given set of functional dependencies |
scientific article |
Statements
On the complexity of finding the set of candidate keys for a given set of functional dependencies (English)
0 references
1976
0 references
