scientific article
From MaRDI portal
Publication:3549613
zbMath1232.68060MaRDI QIDQ3549613
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix ⋮ On regularity of Max-CSPs and Min-CSPs ⋮ Biased random k‐SAT ⋮ Mathematics of computation through the lens of linear equations and lattices ⋮ Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder ⋮ Maximally stable Gaussian partitions with discrete applications ⋮ Noise stability of functions with low influences: invariance and optimality ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
