Is checking if algorithm that solves NP problem running in polynomial time NP problem itself?

37 Views Asked by At

input - correct algorithm A that solves NP class problem, algorithm runs in O(f), is O(f) polynomial?

Let's check with new algorithm B if A runs in polynomial time

what can we say about complexity of this problem?