The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P

Carlos Barron-Romero

Published in: CoRR (2011)

Keyphrases

special case
computational complexity
data sets
closely related
vapnik chervonenkis dimension
database
np complete
approximation error
website
multiscale
np hard