Show simple item record

dc.contributor.authorSchilling, Thorsten Ernsteng
dc.contributor.authorRaddum, Håvardeng
dc.date.accessioned2012-11-19T11:55:27Z
dc.date.available2012-11-19T11:55:27Z
dc.date.issued2010eng
dc.identifier.citationLecture Notes in Computer Science 6087: 151-165eng
dc.identifier.isbn978-3-642-13797-6eng
dc.identifier.urihttp://hdl.handle.net/1956/6194
dc.description.abstractWe 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.eng
dc.language.isoengeng
dc.publisherSpringer Berlin Heidelbergeng
dc.subjectAgreeingeng
dc.subjectMultivariate equation systemeng
dc.subjectSAT-solvingeng
dc.subjectdynamic learningeng
dc.titleSolving Equation Systems by Agreeing and Learningeng
dc.typePeer reviewedeng
dc.typeChaptereng
dc.rights.holderCopyright Springer-Verlag Berlin Heidelberg. All rights reserved.
dc.type.versionacceptedVersioneng
bora.peerreviewedPeer reviewedeng
bibo.doihttp://dx.doi.org/10.1007/978-3-642-13797-6_11eng
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-642-13797-6_11


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record