Computational complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas

Tatjana Schmidt. Computational complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas. PhD thesis, University of Cologne, 2010. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.