Solving congruence equations using Bernstein forms

Publication date 30 June 2016

Congruences in many variables (11D79) Computer solution of Diophantine equations (11Y50) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Systems of nonlinear integral equations (45G15) Symbolic computation and algebraic computation (68W30)

Abstract: We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The proposed method is exponential in the number of variables.

This page was built for publication: Solving congruence equations using Bernstein forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6275118)