Comment on Why cryptography is not based on NP-complete problemsparentComments−JohnKemeny1yDLC is in NP and co-NP. Very unlikely to be NP-hard. It is usually listed as one of the candidates for problems that are NP-intermediate, ie, problems in-between P and NP-hard (should they be different).See e.g. https://cs.stackexchange.com/a/2765
Comments
DLC is in NP and co-NP. Very unlikely to be NP-hard. It is usually listed as one of the candidates for problems that are NP-intermediate, ie, problems in-between P and NP-hard (should they be different).
See e.g. https://cs.stackexchange.com/a/2765