Resource bounded immunity and simplicity

Authors:
Tomoyuki Yamakami;Toshio Suzuki
Affiliations:
School of Information Technology and Engineering, University of Ottawa, Ottawa, Ont., Canada;Department of Mathematics and Information Sciences, Osaka Prefecture University, Osaka, Japan
Venue:
Theoretical Computer Science
Year:
2005

Citing 27
Cited 1

Simplicity, relativizations and nondeterminism

SIAM Journal on Computing
Optimal approximations and polynomially levelable sets

SIAM Journal on Computing
A classification of complexity core lattices

Theoretical Computer Science
On simple and creative sets in NP

Theoretical Computer Science
Diagonalizations over polynomial time computable sets

Theoretical Computer Science
Structural complexity 1

Structural complexity 1
The Boolean hierarchy I: structural properties

SIAM Journal on Computing
Simplicity, immunity, relativizations and nondeterminism

Information and Computation
Strong separations of the polynomial hierarchy with oracles: constructive separations by immune and simple sets

Theoretical Computer Science
Instance complexity

Journal of the ACM (JACM)
A taxonomy of complexity classes of functions

Journal of Computer and System Sciences
Defying upward and downward separation

Information and Computation
Generic separations

Journal of Computer and System Sciences
Computing Solutions Uniquely Collapses the Polynomial Hierarchy

SIAM Journal on Computing
On the Structure of Polynomial Time Reducibility

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

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On Sets Having Only Hard Subsets

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Containment, Separation, Complete Sets, and Immunity of Complexity Classes

ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
Diagonalizing over Deterministic Polynomial Time

CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
Optimal Approximations of Complete Sets

Proceedings of the Conference on Structure in Complexity Theory
Complicated Complementations

COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
A note on genericity and bi-immunity

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
NP-sets are Co-NP-immune relative to a random oracle

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Simplicity and Strong Reductions

Simplicity and Strong Reductions
Polynomial reducibilities and complete sets.

Polynomial reducibilities and complete sets.
The cpa's responsibility for the prevention and detection of computer fraud.

The cpa's responsibility for the prevention and detection of computer fraud.

Immunity and pseudorandomness of context-free languages

Theoretical Computer Science

Quantified Score

Hi-index	5.25

Visualization

Abstract

Revisiting the 30-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.