Enhanced Algorithms for the Representation of integers by Binary Quadratic forms: Reduction to Subset Sum

Maher Mamah

In this paper, we present efficient algorithms for solving the Diophantine equation $f(x,y)=m$ for an arbitrary definite binary quadratic form $f$, given the factorization of $m…