2 citations · 5 across the 14 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CC2018
Sub-exponential complexity of regular linear CNF formulas
Bernd R. Schuh
The study of regular linear conjunctive normal form (LCNF) formulas is of interest because exact satisfiability (XSAT) is known to be NP-complete for this class of formulas. In a r…
cs.CC2018
Sub-exponential Upper Bound for #XSAT of some CNF Classes
Bernd Schuh
We derive an upper bound on the number of models for exact satisfiability (XSAT) of arbitrary CNF formulas F. The bound can be calculated solely from the distribution of positive a…