The existence and density of generalized complexity cores

Authors:
Ronald V. Book;Ding-Zhu Du
Affiliations:
Univ. of California at Santa Barbara, Santa Barbara;Univ. of California at Santa Barbara, Santa Barbara
Venue:
Journal of the ACM (JACM)
Year:
1987

Citing 8
Cited 3

Immunity, relativizations, and nondeterminism

SIAM Journal on Computing
The density and complexity of polynomial cores for intractable sets

Information and Control
Optimal approximations and polynomially levelable sets

SIAM Journal on Computing
Sparse sets lowness and highness

SIAM Journal on Computing
A classification of complexity core lattices

Theoretical Computer Science
Hard-core theorems for complexity classes

Journal of the ACM (JACM)
On Reducibility to Complex or Sparse Sets

Journal of the ACM (JACM)
Generalized complexity cores and levelability of intractable sets (np-complete, polynomial immunity, exponential-time, k-creative, approximation)

Generalized complexity cores and levelability of intractable sets (np-complete, polynomial immunity, exponential-time, k-creative, approximation)

The Non-Recursive Power of Erroneous Computation

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On “inherently context-sensitive” languages - An application of complexity cores

Information Processing Letters
Characterizations and Existence of Easy Sets without Hard Subsets

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

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 &egr; 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.