Computing diverse solutions for a given problem, in particular evolution...
Satisfiability is considered the canonical NP-complete problem and is us...
Propositional satisfiability (SAT) is one of the most fundamental proble...
We investigate the performance of a deterministic GREEDY algorithm for t...
share