Upper bounds for the complexity of sparse and tally descriptions

@article{Arvind1996UpperBF,
  title={Upper bounds for the complexity of sparse and tally descriptions},
  author={Vikraman Arvind and Johannes K{\"o}bler and Martin Mundhenk},
  journal={Mathematical systems theory},
  year={1996},
  volume={29},
  pages={63-94}
}
We investigate the complexity of computing small descriptions for sets in various reduction classes to sparse sets. For example, we show that if a setA and its complement conjunctively reduce to some sparse set, then they also are conjunctively reducible to a P(A ⊕ SAT)-printable tally set. As a consequence, the class IC[log,poly] of sets with low instance complexity is contained in theEL 1 Σ -level of the extended low hierarchy. By refining our techniques, we also show that all word-decreasing… CONTINUE READING

From This Paper

Topics from this paper.

References

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

On the computational complexity of small descriptions

  • O. Watanabe
  • SIAM Journal on Computing , December
  • 1993

Lower bounds for the low hierarchy

  • L. Hemachandra
  • Journal of the ACM
  • 1992

Self - reducibility

  • J.
  • Journal of Computer and System Sciences
  • 1990

Balcfizar and R . Book . Sets with small generalized Kolmogorov complexity

  • J. L. Balctlzar, R.
  • Acta lnformatica
  • 1986