A language L belongs to NP iff there exist a two-input polynomia

A language L belongs to NP iff there exist a two-input polynomial-time algorithm A that verifies language L in polynomial time. ~@[](1)

答案：TRUE