Hadlock (Maximum Cut Maximum Cut)
Jump to navigation
Jump to search
Time Complexity
$O({2}^n)$
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1975