On P-Immunity of Nondeterministic Complete Sets

@inproceedings{Trn1995OnPO,
  title={On P-Immunity of Nondeterministic Complete Sets},
  author={Nicholas Q. Tr{\^a}n},
  booktitle={Structure in Complexity Theory Conference},
  year={1995}
}
We show that every m-complete set for NEXP as well as ats complement have an infinite subset in P. Thw nnswers an open question first raised in [Ber76]. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

ROYER, Every polynomial-time l-degree collapses ifl P = PSPACE

  • S FENNER, S. KURTZ
  • in Proc. 30th FOCS,
  • 1989

A note on one-way functions and polynomial-time isomorphisms

  • LONG, D. Du
  • Theoretical Comput. Sci.,
  • 1987

ZAK, A Turing machine hierarchy

  • S. k
  • Theoretical Comput. Sci.,
  • 1983

HARTMANIS, On isomorphisms and density of NP and other complete sets

  • J. L BERMAN
  • SIAM J. Comput.,
  • 1977

On the structure of complete .ret,s: almost everywhere complexity and in,finitely

  • L. BERMAN
  • Proc. 17th FOCS, IE:EE,
  • 1976

Similar Papers

Loading similar papers…