Pages that link to "Item:Q2729649"
From MaRDI portal
The following pages link to A new way of using semidefinite programming with applications to linear equations mod \(p\) (Q2729649):
Displaying 7 items.
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- An extension of the angular synchronization problem to the heterogeneous setting (Q2148952) (← links)
- Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629) (← links)
- Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem (Q5075818) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- Approximation algorithms on \(k\)-correlation clustering (Q6151012) (← links)