If a CNF contains only Horn and Xor clauses, then what is the complexity of determining Satisfiability?

cs.stackexchange https://cs.stackexchange.com/questions/84146

سؤال

If a CNF contains only Horn and Xor clauses, and does not contain clauses of other types, then can its Satisfiability be determined in polynomial time?

لا يوجد حل صحيح

مرخصة بموجب: CC-BY-SA مع الإسناد
لا تنتمي إلى cs.stackexchange
scroll top