タグpolynomial-time - これはページ7です - GeneraCodice

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

Polynomial Time reducible explanation

https://www.generacodice.com/jp/articolo/1609765/polynomial-time-reducible-explanation
  formal-languages  -  reductions  -  polynomial-time
cs.stackexchange cs.stackexchange

Complexity of an encoded turing machine

https://www.generacodice.com/jp/articolo/1609635/complexity-of-an-encoded-turing-machine
  complexity-theory  -  turing-machines  -  polynomial-time
cs.stackexchange cs.stackexchange

Calculating the number of assignments satisfying a general propositional formula

https://www.generacodice.com/jp/articolo/1608677/calculating-the-number-of-assignments-satisfying-a-general-propositional-formula
  satisfiability  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

Polynomial Time Algorithm for Steiner Tree Problem

https://www.generacodice.com/jp/articolo/1606008/polynomial-time-algorithm-for-steiner-tree-problem
  algorithms  -  polynomial-time
cs.stackexchange cs.stackexchange

Determine whether a system of $n$ linear equations has solutions in $\{0, 1\}^n$ in polynomial time

https://www.generacodice.com/jp/articolo/1605710/determine-whether-a-system-of-n-linear-equations-has-solutions-in-0-1-n-in-polynomial-time
  complexity-theory  -  np-complete  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

Are you allowed to change the specifications of a problem when doing reductions?

https://www.generacodice.com/jp/articolo/1605178/are-you-allowed-to-change-the-specifications-of-a-problem-when-doing-reductions
  graphs  -  reductions  -  polynomial-time
cs.stackexchange cs.stackexchange

Find Hamiltonian cycle in polynomial time

https://www.generacodice.com/jp/articolo/1604751/find-hamiltonian-cycle-in-polynomial-time
  time-complexity  -  polynomial-time  -  hamiltonian-circuit
cs.stackexchange cs.stackexchange

Existence of polynomial time reduction from P to R?

https://www.generacodice.com/jp/articolo/1603343/existence-of-polynomial-time-reduction-from-p-to-r
  complexity-theory  -  computability  -  time-complexity  -  reductions  -  polynomial-time
cs.stackexchange cs.stackexchange

Probability of randomly designated subsets cover the universe

https://www.generacodice.com/jp/articolo/1603289/probability-of-randomly-designated-subsets-cover-the-universe
  discrete-mathematics  -  probability-theory  -  set-cover  -  algorithms  -  polynomial-time
cs.stackexchange cs.stackexchange
結果が見つかりました: 298
scroll top