Jeff L. Xu

most citedIs Planted Coloring Easier than Planted Clique?

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CC2023

Sum-of-Squares Lower Bounds for Densest $k$ -Subgraph

Chris Jones, Aaron Potechin, Goutham Rajendran +1

Given a graph and an integer $k$ , Densest $k$ -Subgraph is the algorithmic task of finding the subgraph on $k$ vertices with the maximum number of edges. This is a fundamental probl…

cs.CC2023★ 1 cited

Is Planted Coloring Easier than Planted Clique?

Pravesh K. Kothari, Santosh S. Vempala, Alexander S. Wein +1

We study the computational complexity of two related problems: recovering a planted $q$ -coloring in $G (n, 1/2)$ , and finding efficiently verifiable witnesses of non- $q$ -colorability…

cs.DS2022

Polynomial-Time Power-Sum Decomposition of Polynomials

Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari +1

We give efficient algorithms for finding power-sum decomposition of an input polynomial $P (x) = \sum_{i \leq m} p_{i} (x)^{d}$ with component $p_{i}$ s. The case of linear $p_{i}$ s is equivale…

Sum-of-Squares Lower Bounds for Densest k-Subgraph

Is Planted Coloring Easier than Planted Clique?

Polynomial-Time Power-Sum Decomposition of Polynomials

Sum-of-Squares Lower Bounds for Densest $k$ -Subgraph