scientific article; zbMATH DE number 7051221
From MaRDI portal
Publication:4633863
zbMath1422.68135MaRDI QIDQ4633863
Prasad Raghavendra, David Steurer
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496828
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Quadratic programming (90C20) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (5)
Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms ⋮ Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms ⋮ Survey on nonlocal games and operator space theory ⋮ Grothendieck constant is norm of Strassen matrix multiplication tensor ⋮ The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
This page was built for publication:
