| tech,20-3-H05-1101,bq | lower-bound </term> for certain classes of <term> | algorithms | </term> that are currently used in the literature | #7496 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. |
