%0 Generic
%A Bentzien, Levke
%D 2000
%F heidok:1384
%K Generizität , ressourcenbeschränktcomplexity, nondeterminism , completeness , resource-bounded , genericity
%R 10.11588/heidok.00001384
%T NP-completeness notions under strong hypotheses
%U https://archiv.ub.uni-heidelberg.de/volltextserver/1384/
%X 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.