Pages that link to "Item:Q6155645"

The following pages link to Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645):

Displaying 1 item.

• Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)