Showing 1–20 of 28 results
/ Date/ Name
Apr 25, 2018On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikesJul 6, 2021On a tracial version of Haemers boundSep 10, 2021Approximate Pythagoras Numbers on $*$-algebras over $\mathbb{C}$May 4, 2017Quantum SDP-Solvers: Better upper and lower boundsApr 15, 2025Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphsMay 1, 2025Revisiting the convergence rate of the Lasserre hierarchy for polynomial optimization over the hypercubeOct 7, 2025Self-concordant Schrödinger operators: spectral gaps and optimization without condition numbersNov 17, 2022A (simple) classical algorithm for estimating Betti numbersJan 15, 2019Semidefinite programming formulations for the completely bounded norm of a tensorSep 3, 2018Convex optimization using quantum oraclesApr 3, 2024On computing approximate Lewis weightsMay 24, 2023A note on the computational complexity of the moment-SOS hierarchy for polynomial optimizationFeb 7, 2020The Haemers bound of noncommutative graphsNov 25, 2020Quantum algorithms for matrix scaling and matrix balancingSep 29, 2021Bounding the separable rank via polynomial optimizationSep 9, 2021Improving quantum linear system solvers via a gradient descent perspectiveAug 4, 2017Lower bounds on matrix factorization ranks via noncommutative polynomial optimizationMay 3, 2016Matrices with high completely positive semidefinite rankMar 4, 2025How to compute the volume in low dimension?Nov 6, 2023Quantum speedups for linear programming via interior point methods