<> "The repository administrator has not yet configured an RDF license."^^ . <> . . "NP-completeness notions under strong hypotheses"^^ . "A variety of completeness notions for the complexity class NP are studied under strong hypotheses about the size of this class. These hypotheses are based on the concept of resource-bounded genericity developed by Ambos-Spies, Fleischhack and Huwig. It is shown that many natural completeness notions for NP can be separated under such hypotheses. E.g., Turing- and truth-table-completeness, truth-table- and bounded-truth-table-completeness (btt-completeness), btt-completeness with two allowed queries and btt-completeness with three allowed queries, and others."^^ . "2000" . . . . . . . . "Levke"^^ . "Bentzien"^^ . "Levke Bentzien"^^ . . . . . . "NP-completeness notions under strong hypotheses (PDF)"^^ . . . "NPCompleteness.pdf"^^ . . . "NP-completeness notions under strong hypotheses (Other)"^^ . . . . . . "small.jpg"^^ . . . "NP-completeness notions under strong hypotheses (Other)"^^ . . . . . . "medium.jpg"^^ . . . "NP-completeness notions under strong hypotheses (Other)"^^ . . . . . . "preview.jpg"^^ . . . "NP-completeness notions under strong hypotheses (Other)"^^ . . . . . . "lightbox.jpg"^^ . . "HTML Summary of #1384 \n\nNP-completeness notions under strong hypotheses\n\n" . "text/html" . . . "510 Mathematik"@de . "510 Mathematics"@en . .