タグ3-sat - これはページ2です - GeneraCodice

一意の1-IN-3 SAT

https://www.generacodice.com/jp/articolo/2464057/一意の1-in-3-sat
  satisfiability  -  np  -  3-sat
cs.stackexchange cs.stackexchange

少なくともkエッジが離れている2つのパスを見つけることを証明する方法はNPハードですか？

https://www.generacodice.com/jp/articolo/2463884/少なくともkエッジが離れている2つのパスを見つけることを証明する方法はnpハードですか
  np-hard  -  3-sat  -  graphs
cs.stackexchange cs.stackexchange

式の長さに関する最先端のSATソルバーの時間の複雑さ

https://www.generacodice.com/jp/articolo/2455775/式の長さに関する最先端のsatソルバーの時間の複雑さ
  turing-machines  -  satisfiability  -  time-complexity  -  3-sat  -  p-vs-np
cs.stackexchange cs.stackexchange

Random restarts for unsatisfiable instances

https://www.generacodice.com/jp/articolo/1620585/random-restarts-for-unsatisfiable-instances
  satisfiability  -  sat-solvers  -  3-sat  -  randomized-algorithms
cs.stackexchange cs.stackexchange

3-CNF to “independent form”

https://www.generacodice.com/jp/articolo/1615377/3-cnf-to-independent-form
  logic  -  3-sat  -  propositional-logic  -  boolean-algebra
cs.stackexchange cs.stackexchange

Is a “local” version of 3-SAT NP-hard?

https://www.generacodice.com/jp/articolo/1612712/is-a-local-version-of-3-sat-np-hard
  satisfiability  -  np-hard  -  3-sat  -  polynomial-time  -  2-sat
cs.stackexchange cs.stackexchange

Parametrized reduction from 3-SAT to Independent Set to lower bound running time under ETH assumption

https://www.generacodice.com/jp/articolo/1612670/parametrized-reduction-from-3-sat-to-independent-set-to-lower-bound-running-time-under-eth-assumption
  complexity-theory  -  3-sat  -  parameterized-complexity
cs.stackexchange cs.stackexchange

Proof that POSITIVE-3-SAT is in the complexity class P

https://www.generacodice.com/jp/articolo/1611559/proof-that-positive-3-sat-is-in-the-complexity-class-p
  satisfiability  -  3-sat  -  normal-forms
cs.stackexchange cs.stackexchange

Fine-grained complexity of 3-CNF formula evaluation

https://www.generacodice.com/jp/articolo/1609047/fine-grained-complexity-of-3-cnf-formula-evaluation
  satisfiability  -  time-complexity  -  sat-solvers  -  3-sat  -  decision-problem
cs.stackexchange cs.stackexchange

Why not do these checks on the number of clauses in 3-SAT?

https://www.generacodice.com/jp/articolo/1605290/why-not-do-these-checks-on-the-number-of-clauses-in-3-sat
  satisfiability  -  sat-solvers  -  3-sat
cs.stackexchange cs.stackexchange
結果が見つかりました: 113
scroll top