Lien (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition)
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(k^{2} n^{2})$ == Space Complexity == $O(k^{2})$ words (Derived: Uses an auxiliary array of size $k \times k$) == Description == Multiway Decomposition Algorithm == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1982 == Reference == https://dl.acm.org/doi/abs/10.1145/319540.319546")
Time Complexity
$O(k^{2} n^{2})$
Space Complexity
$O(k^{2})$ words
(Derived: Uses an auxiliary array of size $k \times k$)
Description
Multiway Decomposition Algorithm
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1982