The UGC Hardness Threshold of theLpGrothendieck Problem
Complexity measures of sign matrices
Mathematics of Operations Research
Combinatorica
Assaf Naor
Guy Kindler
Shahar Mendelson
Adi Shraibman
Nati Linial
Online Matrix Completion for Signed Link Prediction
Bypassing UGC from Some Optimal Geometric Inapproximability Results