Resource Bounded Immunity and Simplicity
Computational Complexity
2010-07-20 v2 Discrete Mathematics
Abstract
Revisiting the thirty years-old notions of resource-bounded immunity and simplicity, we investigate the structural characteristics of various immunity notions: strong immunity, almost immunity, and hyperimmunity as well as their corresponding simplicity notions. We also study limited immunity and simplicity, called k-immunity and feasible k-immunity, and their simplicity notions. Finally, we propose the k-immune hypothesis as a working hypothesis that guarantees the existence of simple sets in NP.
Cite
@article{arxiv.cs/0407015,
title = {Resource Bounded Immunity and Simplicity},
author = {Tomoyuki Yamakami and Toshio Suzuki},
journal= {arXiv preprint arXiv:cs/0407015},
year = {2010}
}
Comments
This is a complete version of the conference paper that appeared in the Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science, Kluwer Academic Publishers, pp.81-95, Toulouse, France, August 23-26, 2004