Tag satisfiability - Esta é a página 45 - GeneraCodice

What's an example of an unsatisfiable 3-CNF formula?

https://www.generacodice.com/pt/articolo/1490986/what-s-an-example-of-an-unsatisfiable-3-cnf-formula
  logic  -  satisfiability  -  3-sat
cs.stackexchange cs.stackexchange

Lower bound on running time for solving 3-SAT if P = NP

https://www.generacodice.com/pt/articolo/1490593/lower-bound-on-running-time-for-solving-3-sat-if-p-np
  complexity-theory  -  satisfiability  -  lower-bounds
cs.stackexchange cs.stackexchange

3-SAT problem with number of clauses equal to number of variables

https://www.generacodice.com/pt/articolo/1490412/3-sat-problem-with-number-of-clauses-equal-to-number-of-variables
  complexity-theory  -  satisfiability  -  np-hard
cs.stackexchange cs.stackexchange

Complexity of calculating a single model versus all models of a propositional formula with a SAT solver

https://www.generacodice.com/pt/articolo/1489959/complexity-of-calculating-a-single-model-versus-all-models-of-a-propositional-formula-with-a-sat-solver
  complexity-theory  -  np-complete  -  satisfiability  -  sat
cs.stackexchange cs.stackexchange

What is a dichotomy? Whether 2-SAT itself is a dichotomy of SAT?

https://www.generacodice.com/pt/articolo/1489897/what-is-a-dichotomy-whether-2-sat-itself-is-a-dichotomy-of-sat
  complexity-theory  -  np-complete  -  satisfiability
cs.stackexchange cs.stackexchange

CNF SAT conversions

https://www.generacodice.com/pt/articolo/1489819/cnf-sat-conversions
  complexity-theory  -  satisfiability  -  reductions
cs.stackexchange cs.stackexchange

Complexity of Double-Horn-SAT?

https://www.generacodice.com/pt/articolo/1489505/complexity-of-double-horn-sat
  complexity-theory  -  np-complete  -  satisfiability  -  complexity-classes
cs.stackexchange cs.stackexchange

Formulas for which any equivalent CNF formula has exponential length

https://www.generacodice.com/pt/articolo/1489278/formulas-for-which-any-equivalent-cnf-formula-has-exponential-length
  satisfiability
cs.stackexchange cs.stackexchange

Complexity of (SAT to 3-SAT) Problem?

https://www.generacodice.com/pt/articolo/1467968/complexity-of-sat-to-3-sat-problem
  complexity-theory  -  satisfiability  -  decision-problem  -  complexity-classes
cs.stackexchange cs.stackexchange

Is MIN or MAX-True-2-XOR-SAT NP-hard?

https://www.generacodice.com/pt/articolo/1467843/is-min-or-max-true-2-xor-sat-np-hard
  complexity-theory  -  satisfiability  -  np-hard
cs.stackexchange cs.stackexchange
Resultados encontrados: 510
scroll top