| dc.contributor.author | Schilling, Thorsten Ernst | eng |
| dc.contributor.author | Raddum, Håvard | eng |
| dc.date.accessioned | 2012-11-19T11:55:27Z | |
| dc.date.available | 2012-11-19T11:55:27Z | |
| dc.date.issued | 2010 | eng |
| dc.Published | Lecture Notes in Computer Science 6087: 151-165 | eng |
| dc.identifier.isbn | 978-3-642-13797-6 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1956/6194 | |
| dc.description.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. | en_US |
| dc.language.iso | eng | eng |
| dc.publisher | Springer Berlin Heidelberg | en_US |
| dc.subject | Agreeing | eng |
| dc.subject | Multivariate equation system | eng |
| dc.subject | SAT-solving | eng |
| dc.subject | dynamic learning | eng |
| dc.title | Solving Equation Systems by Agreeing and Learning | en_US |
| dc.type | Chapter | |
| dc.type | Peer reviewed | |
| dc.description.version | acceptedVersion | en_US |
| dc.rights.holder | Copyright Springer-Verlag Berlin Heidelberg. All rights reserved. | en_US |
| dc.identifier.doi | https://doi.org/10.1007/978-3-642-13797-6_11 | |
