Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:5311:53, 15 February 2023‎ Admin talk contribs‎ 428 bytes +428‎ 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 == 1967 == Reference == https://www.sciencedirect.com/science/article/pii/0166218X92900315"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Brute_force_algorithm_(Functional_Dependency_Inference_Problem_Dependency_Inference_Problem)"