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

DOI10.1016/0020-0190(76)90003-XzbMATH Open0336.68018OpenAlexW2076452193WikidataQ114685349 ScholiaQ114685349MaRDI QIDQ1229752FDOQ1229752

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

• A relational model of data for large shared data banks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposition of a Data Base and the Theory of Boolean Switching Functions

Cited In (5)

• On the number of candidate keys
• The complexity of recognizing 3NF relation schemes
• Title not available (Why is that?)
• Some generalized type functional dependencies formalized as equality set on matrices
• Contribution to the theory of data base relations

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)