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]

Authors

Tatjana Schmidt

This author has not been identified. Look up 'Tatjana Schmidt' in Google