On the complexity of finding the set of candidate keys for a given set of functional dependencies

DOI10.1016/0020-0190(76)90003-XMaRDI QIDQ1229752zbMATH OpenOpenAlexWikidataFDO

Authors K. Appert

Publication date 1976

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(76)90003-x

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 3464830 (Why is no real title available?)
• A relational model of data for large shared data banks
• Decomposition of a Data Base and the Theory of Boolean Switching Functions

Cited in

(5)

• Some generalized type functional dependencies formalized as equality set on matrices
• The complexity of recognizing 3NF relation schemes
• Contribution to the theory of data base relations
• scientific article; zbMATH DE number 3907812 (Why is no real title available?)
• On the number of candidate keys

This page was built for publication: On the complexity of finding the set of candidate keys for a given set of functional dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229752)