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

Casos especiais de SAT e correspondente #SAT com complexidade no máximo O(n^2) AND que possuem algoritmos eficientes para geração de instâncias?

https://www.generacodice.com/pt/articolo/1395356/casos-especiais-de-sat-e-correspondente-sat-com-complexidade-no-maximo-o-n-2-and-que-possuem-algoritmos-eficientes-para-geracao-de-instancias
  logic  -  enumeration  -  counting  -  satisfiability  -  time-complexity
StackOverflow StackOverflow

Converting a 2-SAT formula into an implication graph

https://www.generacodice.com/pt/articolo/1148591/converting-a-2-sat-formula-into-an-implication-graph
  complexity-theory  -  satisfiability
cs.stackexchange cs.stackexchange

Poly-time reduction from ILP to SAT?

https://www.generacodice.com/pt/articolo/1148268/poly-time-reduction-from-ilp-to-sat
  np-complete  -  satisfiability  -  reductions  -  integer-programming
cs.stackexchange cs.stackexchange

Convert $\sum x_i = y$ to 3-sat

https://www.generacodice.com/pt/articolo/1127780/convert-sum-x-i-y-to-3-sat
  satisfiability  -  sat-solvers
cs.stackexchange cs.stackexchange

Complexity of deciding if a formula has exactly 1 satisfying assignment

https://www.generacodice.com/pt/articolo/1126649/complexity-of-deciding-if-a-formula-has-exactly-1-satisfying-assignment
  complexity-theory  -  satisfiability  -  complexity-classes
cs.stackexchange cs.stackexchange

Is the following langauge in $P$ or $NPC$

https://www.generacodice.com/pt/articolo/1124222/is-the-following-langauge-in-p-or-npc
  complexity-theory  -  np-complete  -  satisfiability  -  time-complexity  -  3-sat
cs.stackexchange cs.stackexchange

Modeling the problem of finding all stable sets of an argumentation framework as SAT

https://www.generacodice.com/pt/articolo/1123045/modeling-the-problem-of-finding-all-stable-sets-of-an-argumentation-framework-as-sat
  complexity-theory  -  np-complete  -  satisfiability  -  time-complexity  -  algorithms
cs.stackexchange cs.stackexchange

Converting (math) problems to SAT instances

https://www.generacodice.com/pt/articolo/1122995/converting-math-problems-to-sat-instances
  satisfiability  -  algorithms  -  reductions
cs.stackexchange cs.stackexchange

Prove NP-completeness of deciding satisfiability of monotone boolean formula

https://www.generacodice.com/pt/articolo/1121985/prove-np-completeness-of-deciding-satisfiability-of-monotone-boolean-formula
  complexity-theory  -  np-complete  -  satisfiability
cs.stackexchange cs.stackexchange

Asymptotic bounds on number of 3SAT formulas with unique solutions

https://www.generacodice.com/pt/articolo/1121443/asymptotic-bounds-on-number-of-3sat-formulas-with-unique-solutions
  complexity-theory  -  np-complete  -  satisfiability  -  reference-request
cs.stackexchange cs.stackexchange
Resultados encontrados: 510
scroll top