scientific article
From MaRDI portal
Publication:3549717
zbMath1231.68141MaRDI QIDQ3549717
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems ⋮ Maximally stable Gaussian partitions with discrete applications ⋮ Noise stability of functions with low influences: invariance and optimality ⋮ Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
This page was built for publication:
