Pages that link to "Item:Q5176000"

The following pages link to Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q5176000):

Displaying 10 items.

• Angular synchronization by eigenvectors and semidefinite programming (Q617701) (← links)
• An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
• Trigonometric approximation of the max-cut polytope is star-like (Q2673542) (← links)
• A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem (Q2920470) (← links)
• Is constraint satisfaction over two variables always easy? (Q3156915) (← links)
• (Q4607980) (← links)
• Complex semidefinite programming and Max-\(k\)-Cut (Q5240428) (← links)
• The Approximability of Three-valued MAX CSP (Q5470737) (← links)
• Semi-definite programming and quantum information (Q6561827) (← links)