Unsatisfiable Systems of Equations, Over a Finite Field

The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the number of solutions is given, which can actually be useful for computing that number in the special case where all the equations are of degree 2. When such a quadratic system has no solution, there is always a proof of unsatisfiability of size qn=2 times a polynomial in n and q, which can be checked deterministically in time satisfying a similar bound. Such a proof can be found by a probabilistic algorithm in time asymptotic to that required to test, by substitution in k quadratic equations, all qn potential solutions.

• Type: Conference
• Year: 1998
• Where: FOCS
• Authors: Alan R. Woods
• Keywords: FOCS 1998, Particular Emphasis, Simultaneous Equations, Size Qn=2 Times, Theoretical Computer Science