期刊名称:Chicago Journal of Theoretical Computer Science
印刷版ISSN:1073-0486
出版年度:2013
卷号:2013
出版社:MIT Press ; University of Chicago, Department of Computer Science
摘要:The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably simpler, semidefinite programming formulations of these norms.