scientific article
From MaRDI portal
Publication:3191598
DOI10.4086/toc.2013.v009a028zbMath1366.68075OpenAlexW2405388088MaRDI QIDQ3191598
Publication date: 6 October 2014
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2013.v009a028
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fourier transformapproximation algorithmslinearity testingprobabilistically checkable proofsinapproximabilityPCPGrothendieck inequalitylabel cover
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Grothendieck-Type Inequalities in Combinatorial Optimization ⋮ The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins ⋮ A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems ⋮ On non-optimally expanding sets in Grassmann graphs
Cites Work
