scientific article; zbMATH DE number 6797639
From MaRDI portal
Publication:5371213
zbMath1373.68239MaRDI QIDQ5371213
Publication date: 25 October 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completenessapproximation algorithmsprobabilistically checkable proofsdiscrete Fourier analysisinapproximability
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (2)
Pseudorandom sets in Grassmann graph have near-perfect expansion ⋮ Algorithms approaching the threshold for semi-random planted clique
This page was built for publication:
