other,1-3-H05-1101,bq | Two <term> hardness </term> results for the class <term> NP </term> are reported , along with an <term> exponential time lower-bound </term> for certain classes of <term> algorithms </term> that are currently used in the literature . | #7477 Two hardness results for the class NP are reported, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the literature. |