The graph isomorphism problem, the discrete logarithm problem and the integer factorization problem are examples of problems believed to be NP-intermediate.
What is an example of an NP-intermediate problem not known to exist in P or NP-complete? 
graph isomorphism problem