Title :
On P-immunity of nondeterministic complete sets
Author_Institution :
Dept. of Comput. & Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA
Abstract :
We show that every m-complete set for NEXP as well as its complement have an infinite subset in P. This answers an open question first raised by L. Berman (1976)
Keywords :
computational complexity; NEXP; P-immunity; infinite subset; m-complete set; nondeterministic complete sets; Information science; Polynomials; Turing machines;
Conference_Titel :
Structure in Complexity Theory Conference, 1995., Proceedings of Tenth Annual IEEE
Conference_Location :
Minneapolis, MN
Print_ISBN :
0-8186-7052-5
DOI :
10.1109/SCT.1995.514864
