On the complexity of finding the set of candidate keys for a given set of functional dependencies (Q1229752): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(76)90003-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076452193 / rank | |||
Normal rank | |||
Latest revision as of 10:08, 30 July 2024
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
