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$$ such that L = { $$x$$ ∈ {0, 1}* there exists a certificate $$y$$ such that $$A(x, y) = 1$$ }. ~@[](1)

答案：FALSE