On the (Non) NP-Hardness of Computing Circuit Complexity