
Balanced incomplete block designs and exact satisfiability
The paper explores the correspondence between balanced incomplete block ...
read it

Subexponential complexity of regular linear CNF formulas
The study of regular linear conjunctive normal form (LCNF) formulas is o...
read it

XSAT of Linear CNF Formulas
Open questions with respect to the computational complexity of linear CN...
read it

XSAT of Exact Linear CNF Classes
It is shown that lregularity implies kuniformity in exact linear CNF f...
read it

A criterion for "easiness" of certain SAT problems
A generalized 1in3SAT problem is defined and found to be in complexity...
read it
Bernd. R. Schuh
is this you? claim profile