Publication View

Optp (A) ≔ max ai jxixj: (x1,..., xn) ∈ R (2009)

Abstract

For p ≥ 2 we consider the problem of, given an n × n matrix A = (ai j) whose diagonal entries vanish, approximating in polynomial time the number n�

Publication details

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.2343
Source	http://www.wisdom.weizmann.ac.il/~gideon/papers/LpGrothendieck2.pdf
Contributors	CiteSeerX
Repository	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type	text
Language	English
Relation	10.1.1.133.5651, 10.1.1.49.572, 10.1.1.135.7124, 10.1.1.37.593, 10.1.1.21.7365, 10.1.1.131.3405, 10.1.1.4.7524, 10.1.1.128.4400, 10.1.1.67.7020, 10.1.1.123.1190, 10.1.1.28.9786, 10.1.1.115.5155, 10.1.1.126.5975