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

Pergunta

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?

Nenhuma solução correta

Licenciado em: CC-BY-SA com atribuição
Não afiliado a cs.stackexchange
scroll top