# Algorithm for solving binary quadratic Diophantine equations (BQDE) and its CTC

Consider an equation of the form:

$Ax^2+Bxy+Cy^2+Dx+Ey+F=0$

where A-F are integer coefficients (binary quadratic Diophantine equation). I consider here the most general form, so assume all coefficients are non-zero.

Is there an efficient algorithm which can compute integer solutions for this type of equation?

• mathoverflow.net/questions/142938/… – adrianN Oct 5 '16 at 10:04