What is the best known algorithm to solve linear congruences of the form below? $$a x + b \equiv 0 \space (n)$$
And what is the time complexity of it?
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It only takes a minute to sign up.Sign up to join this community