Author

Assaf Naor

Created by Alysson Bolognesi Prado at 2019-03-27 14:43:14.0.

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Edson Pacheco Paladini's Lattes?

Cole aqui o código fonte do lattes da pessoa:

Sim, eu sei, isso é feio, é horrível. Mas o Lattes mudou para o recaptcha, e agora não sei mais como contornar.

Yes

Why?

Publications

Approximating the cut-norm via Grothendieck’s inequality

Efficient rounding for the noncommutative grothendieck inequality

Data-dependent hashing via nonlinear spectral gaps

Approximating the Cut-Norm via Grothendieck’s Inequality

The UGC Hardness Threshold of theLpGrothendieck Problem

Published At

SIAM Journal on Computing

Mathematics of Operations Research

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC ’13

Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04

Co-Authors

Referenced By

Bypassing UGC from Some Optimal Geometric Inapproximability Results