3 ms·
Yes, you're right. NP-complete. My mistake This arXiv paper shows the STOA from 2015: https://arxiv.org/pdf/1507.02318.pdf https://arxiv.org/pdf/1507.02318.pdf
by visarga 9y ago
Yes, you're right. NP-complete. My mistake
This arXiv paper shows the STOA from 2015: https://arxiv.org/pdf/1507.02318.pdf https://arxiv.org/pdf/1507.02318.pdf
It works in pseudopolynomial time. I read that it's quite an important problem, related to graphs and encryption.