scientific article; zbMATH DE number 6783412
From MaRDI portal
Publication:5365060
zbMath1373.68252MaRDI QIDQ5365060
David Steurer, Thomas Holenstein, Boaz Barak, Moritz Hardt
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133077
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (4)
Amplification and Derandomization without Slowdown ⋮ On percolation and ‐hardness ⋮ Sublinear Algorithms for MAXCUT and Correlation Clustering ⋮ Sherali-adams strikes back
This page was built for publication: