OKullmann/oklibrary — pull request #405 by MGwynne (2012-04-03 09:55:36+00:00)
Title: Genhornhardness

Branch: genhornhardness.

Investigating the size of 1-bases for the satisfiable tree-clause-sets.

Three things of note so far:

1) These things seem (at least in the small number of cases seen so far) to have small 1-bases.
2) We need generators for the prime implicates, as the full CNF is much larger than the number of
prime implicates.
3) The tools for computing the 1-bases (RandomRUcpBase) need to be improved as currently it
tries to do too much and isn't usable in a controlled way.

With regard to point (3), I'll make a separate commit with a todo on improving this script.

Matthew