NP-intermediate
In computational complexity , problems that are in the complexity class NP but are neither in the class P nor NP-complete are called NP-intermediate , and the class of such problems is called NPI . 
<triplet> complexity class <subj> computational complexity <obj> part of <triplet> NP <subj> complexity class <obj> instance of <triplet> NP-intermediate <subj> complexity class <obj> instance of