Chapter

Arithmetic of Finite Fields

Volume 6087 of the series Lecture Notes in Computer Science pp 151-165

Solving Equation Systems by Agreeing and Learning

  • Thorsten Ernst SchillingAffiliated withLancaster UniversitySelmer Center, University of Bergen
  • , Håvard RaddumAffiliated withLancaster UniversitySelmer Center, University of Bergen

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We study sparse non-linear equation systems defined over a finite field. Representing the equations as symbols and using the Agreeing algorithm we show how to learn and store new knowledge about the system when a guess-and-verify technique is used for solving. Experiments are then presented, showing that our solving algorithm compares favorably to MiniSAT in many instances.

Keywords

agreeing multivariate equation system SAT-solving dynamic learning