36 citations · 115 across the 12 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2006★ 2 cited
Convex Separation from Optimization via Heuristics
Lawrence M. Ioannou, Benjamin C. Travaglione, Donny Cheung
Let be a full-dimensional convex subset of . We describe a new polynomial-time Turing reduction from the weak separation problem for to the weak optimization…
cs.DS2005★ 4 cited
Computing finite-dimensional bipartite quantum separability
Lawrence M. Ioannou
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represent…