The structure of generalized complexity cores (Q1115611): Difference between revisions

Structural properties of computational complexity cores are studied. It is shown that every set A has a proper hard core with respect to any countable class C which is closed under finite union and under finite variation. Similar results for C-levelable sets are obtained. The results presented in this paper are straightforward generalizations of results obtained by other authors for the special case \(C=polynomial\) time.