Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem)
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
1967
Reference
https://www.sciencedirect.com/science/article/pii/0166218X92900315