On the complexity of finding the set of candidate keys for a given set of functional dependencies (Q1229752): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q114685349 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A relational model of data for large shared data banks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4050126 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of a Data Base and the Theory of Boolean Switching Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4050122 / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
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