Affiliation:
1. Univ. of California at Santa Barbara, Santa Barbara
Abstract
If
C
is a class of sets and
A
is not in
C
, then an infinite set
H
is a
proper hard core for A with respect to C
, if
H
⊆
A
and for every
C
ε
C
such that
C
⊆
A
,
C
⋒
H
is finite. It is shown that if
C
is a countable class of sets of strings that is closed under finite union and finite variation, then every infinite set not in
C
has a proper hard core with respect to
C
. In addition, the density of such generalized complexity cores is studied.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference22 articles.
1. Bi-immunity for complexity classes;BALCA ZAR;Math. Syst. Theory,1985
2. Sparse Sets, Lowness and Highness
3. On isomorphism and density of NP and other complete sets;BERMAN L.;SlAM J. Comput.,1977
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献