Schlimmer (Functional Dependency Inference Problem Dependency Inference Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n {2}^n p)$
Space Complexity
$O({2}^n)$ words
((original source, but without user-supplied bound)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1993
Reference
https://www.aaai.org/Papers/Workshops/1993/WS-93-02/WS93-02-017.pdf