Login / Signup
On the Complexity of Rearrangement Problems under the Breakpoint Distance
Jakub Kovác
Published in:
CoRR (2011)
Keyphrases
</>
decision problems
computational cost
worst case
optimization problems
problems involving
neural network
computational complexity
np hardness
polynomial hierarchy
feature space
artificial neural networks
special case
np hard
multi class
practical problems