Approximating the cut-norm via Grothendieck's inequality
N. Alon, и A. Naor. Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, стр. 72--80. (2004)
DOI: 10.1145/1007352.1007371
%0 Conference Paper
%1 DBLP:conf/stoc/AlonN04
%A Alon, Noga
%A Naor, Assaf
%B Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004
%D 2004
%K approximation grothendieck quadraticprograms
%P 72--80
%R 10.1145/1007352.1007371
%T Approximating the cut-norm via Grothendieck's inequality
%U http://doi.acm.org/10.1145/1007352.1007371
@inproceedings{DBLP:conf/stoc/AlonN04,
added-at = {2017-10-17T22:10:47.000+0200},
author = {Alon, Noga and Naor, Assaf},
bibsource = {dblp computer science bibliography, http://dblp.org},
biburl = {https://www.bibsonomy.org/bibtex/2aee0282472d685d4bc98c3f21463ad01/prathyush},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004},
crossref = {DBLP:conf/stoc/2004},
doi = {10.1145/1007352.1007371},
interhash = {89db471036cbcb29d4b191512790a5f0},
intrahash = {aee0282472d685d4bc98c3f21463ad01},
keywords = {approximation grothendieck quadraticprograms},
pages = {72--80},
timestamp = {2017-10-17T22:10:47.000+0200},
title = {Approximating the cut-norm via Grothendieck's inequality},
url = {http://doi.acm.org/10.1145/1007352.1007371},
year = 2004
}