Results 121 to 130 of about 460,881 (203)

Strong NP-hardness of the quantum separability problem

open access: yes, 2010
Given the density matrix ρ of a bipartite quantum state, the quantum separability problem asks whether ρ is entangled or separable. In 2003, Gurvits showed that this problem is NP-hard if ρ is located within an inverse exponential (with respect to ...
Sevag Gharibian
core  

Haplotype-aware long-read error correction. [PDF]

open access: yesAlgorithms Mol Biol
Barak P, Gibney D, Jain C.
europepmc   +1 more source

NP-hardness of collective pursuiting optimization problems

open access: yes
The differential pursuitevasion games on a plane are considered. A group of pursuers is created for every evader in a game. The optimization problem of group composition has been formulated.
Pashko, S.V.
core  

Home - About - Disclaimer - Privacy