This paper deals with complexity classes P-C and NPC as they were intr
oduced over the complex numbers by Blum, Shub, and Smale [Bull. Amer.
Math. Soc., 21 (1989), p. 1]. Under the assumption P-C not equal NPC t
he existence of noncomplete problems in NPC not belonging to P-C is es
tablished.