scientific article; zbMATH DE number 549085

MaRDI QIDQ4286895zbMATH OpenFDO

Authors Vu Duc Thi, J. Demetrovics

Publication date 3 May 1994

zbMATH Keywords

decompositionnormal formsArmstrong relationtime complexityBoyce-Codd normal formfunctional dependencyrelational datamodelloss-less-join property

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Recommendations

• Some computational problems related to Boyce-Codd normal form
• Uniform normal form for general time-bounded complexity classes
• On the computational complexity of Bongartz's algorithm
• Time-space tradeoffs in algebraic complexity theory
• scientific article; zbMATH DE number 1504686
• On the complexity of shortest disjunctive normal forms of Boolean functions
• Primitive normalisers in quasipolynomial time
• Parameterized and Exact Computation
• Normalizes and permutational isomorphisms in simply-exponential time
• scientific article; zbMATH DE number 3637838

Cited in

(5)

• scientific article; zbMATH DE number 4057060 (Why is no real title available?)
• Finding Faithful Boyce-Codd Normal Form Decompositions
• Some computational problems related to Boyce-Codd normal form
• scientific article; zbMATH DE number 3850498 (Why is no real title available?)
• Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time

This page was built for publication:

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