scientific article
From MaRDI portal
Publication:3096713
zbMath1252.68143MaRDI QIDQ3096713
Publication date: 11 November 2011
Full work available at URL: http://ebooks.worldscinet.com/ISBN/9789814324359/9789814324359_0163.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completenessapproximation algorithmsprobabilistically checkable proofsdiscrete Fourier analysisinapproximability
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Vertical perimeter versus horizontal perimeter ⋮ Reoptimization of constraint satisfaction problems with approximation resistant predicates ⋮ Pseudorandom sets in Grassmann graph have near-perfect expansion ⋮ Mathematics of computation through the lens of linear equations and lattices ⋮ Interactions of computational complexity theory and mathematics ⋮ On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field ⋮ Three candidate plurality is stablest for small correlations
This page was built for publication:
