1

https://cs.stackexchange.com/search?q=Why+is+linear+programming+is+NP+problem%3F

I read this paper saying: ...finding the shortest solution for a linear Diophantine equation is a NP problem?

I have two questions:

1). What it means of "the shortest solution" for linear Diophantine equation?

2). Dose it means if we don't purse "the shortest solution" for a linear Diophantine equation, then solving linear Diophantine equation will be a P problem?

The complete paper link is: https://dialnet.unirioja.es/descarga/articulo/2383100.pdf

xMath
  • 95
  • 1
    A bad abstract , since it does not clarify non-standard terminologies. I have no idea either what "shortest" means in this context. – Peter Sep 04 '23 at 08:27
  • Might be it is. The complete paper link: https://dialnet.unirioja.es/descarga/articulo/2383100.pdf – xMath Sep 05 '23 at 07:21

0 Answers0