Derek's Algorithm ( 4NF Decomposition)
Jump to navigation
Jump to search
Time Complexity
$O({2}^n)$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1983
$O({2}^n)$
()
Exact
No, deterministic
1983