Adjective
NP-equivalent (not comparable)
(computing theory) Both NP-easy and NP-hard.
To show that FIND-SUBSET-SUM is NP-equivalent, we must show that it is both NP-hard and NP-easy. Source: Internet
For example, the problem FIND-SUBSET-SUM is in NP-equivalent. Source: Internet