We develop a framework for proving rapid convergence of shifted QR algor...
We give a self-contained randomized algorithm based on shifted inverse
i...
Rapid convergence of the shifted QR algorithm on symmetric matrices was ...
We study the problem of efficiently refuting the k-colorability of a gra...
Let G_n be an n × n matrix with real i.i.d. N(0,1/n) entries, let
A be a...
We exhibit a randomized algorithm which given a square n× n complex
matr...
We propose a new hierarchy of semidefinite programming relaxations for
i...
We prove that in sparse Erdős-Rényi graphs of average degree d, the
vect...
A matrix A∈C^n× n is diagonalizable if it has a basis of
linearly indepe...
We consider the problem of Gaussian mixture clustering in the
high-dimen...