Under the auspices of the Computational Complexity Foundation (CCF)

We show that there are infinitely many primes $p$, suchthat the subgroup membership problem for PSL(2,p) belongsto $\NP \cap \coNP$.