Solving Equation Systems by Agreeing and Learning
TypePeer reviewed; Chapter
MetadataShow full item record
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.
Lecture Notes in Computer Science 6087: 151-165
PublisherSpringer Berlin Heidelberg
Copyright Springer-Verlag Berlin Heidelberg. All rights reserved.