scientific article
From MaRDI portal
Publication:3059320
zbMath1204.90088MaRDI QIDQ3059320
Publication date: 8 December 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (11)
Hard constraint satisfaction problems have hard gaps at location 1 ⋮ From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes ⋮ Complexity and approximability of parameterized MAX-CSPs ⋮ Pseudorandom sets in Grassmann graph have near-perfect expansion ⋮ On the Approximability of the Minimum Weight $t$-partite Clique Problem ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ Parallel Repetition of Two-Prover One-Round Games: An Exposition ⋮ Smooth and strong PCPs ⋮ Product-state approximations to quantum states ⋮ Minimum weakly fundamental cycle bases are hard to find
This page was built for publication:
