2 papers
math.OC2021
Optimal solutions and ranks in the max-cut SDP
Daniel Hong, Hyunwoo Lee, Alex Wei
The max-cut problem is a classical graph theory problem which is NP-complete. The best polynomial time approximation scheme relies on \emph{semidefinite programming} (SDP). We stud…
math.NA2019
Randomized Computation of Continuous Data: Is Brownian Motion Computable?
Willem Fouché, Hyunwoo Lee, Donghyun Lim +3
We consider randomized computation of continuous data in the sense of Computable Analysis. Our first contribution formally confirms that it is no loss of generality to take as samp…