Schlimmer (Functional 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}^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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Schlimmer_(Functional_Dependency_Inference_Problem_Dependency_Inference_Problem)&oldid=44855"