# Is “Solving two-variable quadratic polynomials over the Integers” is an NP-Complete Problem?

On this Wikipedia article, it claims that given $$A, B, C \geq 0, \; \in \mathbb{Z}$$, finding $$x, \,y \geq 0, \, \in \mathbb{Z}$$ for $$Ax^2+Bx^2-C=0$$ is NP-complete? Given by how easy I can solve some (with nothing but Wolfram), it doesn’t seem right. I’m sure it’s either written incorrectly or I’m just misunderstanding something.