Jump to content

Chaff algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by McCart42 (talk | contribs) at 21:56, 22 September 2005 (sp, fix stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Chaff is an algorithm for solving instances of the boolean satisfiability problem. It was designed by researchers at Princeton University.

Implementations

Some available implementations of the algorithm in software are mChaff and zChaff, the latter one being the most widely known and used.