Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tags: Manual revert Reverted |
No edit summary Tags: Manual revert Reverted |
||
Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{2. | $O(n^{2.518})$ | ||
== Space Complexity == | == Space Complexity == |
Revision as of 09:51, 10 April 2023
Time Complexity
$O(n^{2.518})$
Space Complexity
$O(n^{2})$ words
(see (boolean) matrix multiplication)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1980