Sets with small generalized Kolmogorov complexity

@article{Balczar1986SetsWS,
  title={Sets with small generalized Kolmogorov complexity},
  author={Jos{\'e} L. Balc{\'a}zar and Ronald V. Book},
  journal={Acta Informatica},
  year={1986},
  volume={23},
  pages={679-688}
}
We study the class of sets with small generalized Kolmogorov complexity. The following results are established: 1. A set has small generalized Kolmogorov complexity if and only if it is “semi-isomorphic” to a tally set. 2. The class of sets with small generalized Kolmogorov complexity is properly included in the class of “self-p-printable” sets. 3. The class of self-p-printable sets is properly included in the class of sets with “selfproducible circuits”. 4. A set S has self-producible circuits… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Generalized Kolmogorov complexity and the structure of feasible computations

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) • 1983
View 9 Excerpts
Highly Influenced

On Sparse Oracles Separating Feasible Complexity Classes

Inf. Process. Lett. • 1988
View 4 Excerpts
Highly Influenced

On Circuit-Size Complexity and the Low Hierarchy in NP

SIAM J. Comput. • 1985
View 4 Excerpts
Highly Influenced

A low- and a high-hierarchy in NP

U. Sch6ning
J. Comput. Syst. Sci. 27, 14-28 • 1983
View 5 Excerpts
Highly Influenced

The Complexity of Sparse Sets in P

Structure in Complexity Theory Conference • 1986

Similar Papers

Loading similar papers…