Computational Hardness of Reinforcement Learning with Partial $q^π$-Realizability