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

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

Understanding DPLL algorithm

https://www.generacodice.com/pt/articolo/1120400/understanding-dpll-algorithm
  logic  -  satisfiability  -  sat-solvers  -  algorithms
cs.stackexchange cs.stackexchange

TAPL: Explanation and example(s) for satisfied

https://www.generacodice.com/pt/articolo/1119413/tapl-explanation-and-example-s-for-satisfied
  satisfiability  -  term-rewriting  -  operational-semantics  -  small-step-semantics
cs.stackexchange cs.stackexchange

Why is MAX-2SAT not in P?

https://www.generacodice.com/pt/articolo/1118929/why-is-max-2sat-not-in-p
  complexity-theory  -  np-complete  -  satisfiability
cs.stackexchange cs.stackexchange

A dense NP complete language implies P=NP

https://www.generacodice.com/pt/articolo/1117472/a-dense-np-complete-language-implies-p-np
  complexity-theory  -  np-complete  -  satisfiability  -  time-complexity
cs.stackexchange cs.stackexchange

Is there a sometimes-efficient algorithm to solve #SAT?

https://www.generacodice.com/pt/articolo/1116613/is-there-a-sometimes-efficient-algorithm-to-solve-sat
  complexity-theory  -  satisfiability  -  reference-request
cs.stackexchange cs.stackexchange

Find $\epsilon'$ s.t $L_\epsilon$ is $\mathsf{NP}$-hard for any $\epsilon<\epsilon'$

https://www.generacodice.com/pt/articolo/1111537/find-epsilon-s-t-l-epsilon-is-mathsf-np-hard-for-any-epsilon-epsilon
  complexity-theory  -  satisfiability  -  approximation
cs.stackexchange cs.stackexchange

Simple proof that circuit satisfiability problem is NP-Hard

https://www.generacodice.com/pt/articolo/1110452/simple-proof-that-circuit-satisfiability-problem-is-np-hard
  complexity-theory  -  satisfiability  -  np-hard  -  circuits
cs.stackexchange cs.stackexchange
Resultados encontrados: 510
scroll top