Kevin L. Chang

collaborators

2 papers

cs.DS2018

Rounding semidefinite programs for large-domain problems via Brownian motion

Kevin L. Chang, Alantha Newman

We present a new simple method for rounding a semidefinite programming relaxation of a constraint satisfaction problem. We apply it to the problem of approximate angular synchroniz…

math.CO2017

Upper Bounds for Ordered Ramsey Numbers of Small 1-Orderings

Kevin Chang

A $k$ -ordering of a graph $G$ assigns distinct order-labels from the set ${1, \dots, ∣ G ∣}$ to $k$ vertices in $G$ . Given a $k$ -ordering $H$ , the ordered Ramsey number $R_{<} (H)$ is…