Michał Górny <mgo...@gentoo.org> wrote: > b? ( a ) c? ( b ) d? ( c ) e? ( d ) ...
As written in another posting: This is 2SAT. 2SAT is solvable in linear time. To get a hard example you have to use several 3SAT clauses, i.e. || ( ... ) with 3 (or more) entries (and all of these entries must occur in the other clauses, of course, to get a hard example).
