Complexity of deciding the satisfiability of a quasi-monotone CNF formula

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

Pergunta

A quasi-monotone CNF formula is a formula where each variable appears at most once as a positive literal (and any number of times as a negative literal).

What is the complexity of deciding its satisfiability?

Nenhuma solução correta

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