%0 Journal Article %T Simpler semidefinite programs for completely bounded norms %A John Watrous %J Mathematics %D 2012 %I arXiv %X 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 much simpler, semidefinite programming formulations of these norms. %U http://arxiv.org/abs/1207.5726v2