Tag 2-sat - Esta é a página 3 - GeneraCodice

Even, Itai & Shamir's limited backtracking algorithm for 2-SAT: is it really linear?

https://www.generacodice.com/pt/articolo/1589193/even-itai-shamir-s-limited-backtracking-algorithm-for-2-sat-is-it-really-linear
  satisfiability  -  time-complexity  -  algorithms  -  2-sat
cs.stackexchange cs.stackexchange

2CNF with 3 variable occurences

https://www.generacodice.com/pt/articolo/1588229/2cnf-with-3-variable-occurences
  boolean-algebra  -  2-sat
cs.stackexchange cs.stackexchange

Is this case of weighted 2SAT NP-complete?

https://www.generacodice.com/pt/articolo/1587945/is-this-case-of-weighted-2sat-np-complete
  np-complete  -  2-sat
cs.stackexchange cs.stackexchange

Is this possible to solve 4SAT in polynomial time? [closed]

https://www.generacodice.com/pt/articolo/1586012/is-this-possible-to-solve-4sat-in-polynomial-time-closed
  satisfiability  -  sat-solvers  -  propositional-logic  -  2-sat
cs.stackexchange cs.stackexchange

How to do last step of Krom's algorithm for solving 2SAT problems

https://www.generacodice.com/pt/articolo/1562071/how-to-do-last-step-of-krom-s-algorithm-for-solving-2sat-problems
  algorithms  -  2-sat
cs.stackexchange cs.stackexchange

Can you solve 2-sat problem when truth assignments of some variables are determined

https://www.generacodice.com/pt/articolo/1560542/can-you-solve-2-sat-problem-when-truth-assignments-of-some-variables-are-determined
  2-sat
cs.stackexchange cs.stackexchange

Schaefer's dichotomy theorem and reformulating 3-literal clauses

https://www.generacodice.com/pt/articolo/1560429/schaefer-s-dichotomy-theorem-and-reformulating-3-literal-clauses
  complexity-theory  -  np-complete  -  satisfiability  -  p-vs-np  -  2-sat
cs.stackexchange cs.stackexchange

Is 2-SAT with XOR-relations NP-complete?

https://www.generacodice.com/pt/articolo/1545091/is-2-sat-with-xor-relations-np-complete
  np-complete  -  satisfiability  -  xor  -  2-sat
cs.stackexchange cs.stackexchange
Resultados encontrados: 36
scroll top