Fagin (4NF Decomposition for Functional and Multivalued Dependency Sets 4NF Decomposition)

From Algorithm Wiki
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == exponential == Space Complexity == exponential words (https://link.springer.com/article/10.1007/BF01934180) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1977 == Reference == https://dl.acm.org/doi/abs/10.1145/320557.320571")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

exponential

Space Complexity

exponential words

(https://link.springer.com/article/10.1007/BF01934180)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1977

Reference

https://dl.acm.org/doi/abs/10.1145/320557.320571

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Fagin_(4NF_Decomposition_for_Functional_and_Multivalued_Dependency_Sets_4NF_Decomposition)&oldid=45737"