The number of steps for construction of a Boolean solution to polynomial congruences and systems of polynomial congruences
Nikolai K. Kosovskii, Tatiana Matveevna Kosovskaya · Vestnik St Petersburg University Mathematics · 2007
Fixing the parameter, we decompose some NP-complete problems connected with the solution of congruences (and incongruences) of arithmetic terms modulo prime numbers into an infinite collection of problems for which polynomial-time algorithms are developed.