The Community for Technology Leaders
Structure in Complexity Theory Conference, Annual (1995)
Minneapolis, Minnesota
June 19, 1995 to June 22, 1995
ISSN: 1063-6870
ISBN: 0-8186-7052-5
pp: 262
N. Tran , Dept. of Comput. & Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA
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).
computational complexity; P-immunity; nondeterministic complete sets; m-complete set; NEXP; infinite subset

N. Tran, "On P-immunity of nondeterministic complete sets," Structure in Complexity Theory Conference, Annual(SCT), Minneapolis, Minnesota, 1995, pp. 262.
82 ms
(Ver 3.3 (11022016))