Räihä; Manilla (Multivalued Dependency Inference Problem Dependency Inference Problem)

From Algorithm Wiki

Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} {2}^n p log p)$ == Space Complexity == $O(n2^n)$? words (bound on size of output (2^n domains, O(n) possible attributes per domain); can probably be improved) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1992 == Reference == https://www.sciencedirect.com/science/article/pii/0166218X92900315")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{2} {2}^n p log p)$

Space Complexity

$O(n2^n)$? words

(bound on size of output (2^n domains, O(n) possible attributes per domain); can probably be improved)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1992

Reference

https://www.sciencedirect.com/science/article/pii/0166218X92900315

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Räihä;_Manilla_(Multivalued_Dependency_Inference_Problem_Dependency_Inference_Problem)&oldid=44865"