On the complexity of finding the set of candidate keys for a given set of functional dependencies
type: Item
instance of: scholarly article
title: On the complexity of finding the set of candidate keys for a given set of functional dependencies
zbMATH Open document ID: 0336.68018
DOI: 10.1016/0020-0190(76)90003-X
author: K. Appert
published in: Information Processing Letters
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3526288
Wikidata QID: Q114685349
MaRDI profile type: Publication
cites work: A relational model of data for large shared data banks
cites work: Q4050126
cites work: Decomposition of a Data Base and the Theory of Boolean Switching Functions
cites work: Q4050122
full work available at URL: 0020-0190(76)90003-x
OpenAlex ID: W2076452193
description: scientific article; zbMATH DE number 3526288