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

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).

INDEX TERMS

computational complexity; P-immunity; nondeterministic complete sets; m-complete set; NEXP; infinite subset

CITATION

N. Tran, "On P-immunity of nondeterministic complete sets,"

*Structure in Complexity Theory Conference, Annual(SCT)*, Minneapolis, Minnesota, 1995, pp. 262.

doi:10.1109/SCT.1995.514864

CITATIONS

SEARCH