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

Simple Hamiltonian cycle reduction

https://www.generacodice.com/jp/articolo/1615513/simple-hamiltonian-cycle-reduction
  np-complete  -  polynomial-time
cs.stackexchange cs.stackexchange

Number of equivalence classes in $P$

https://www.generacodice.com/jp/articolo/1613709/number-of-equivalence-classes-in-p
  complexity-theory  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

is $x^{100000000000}$ a “polynomial time”?

https://www.generacodice.com/jp/articolo/1613479/is-x-100000000000-a-polynomial-time
  polynomial-time
cs.stackexchange cs.stackexchange

Reduce 4-SAT to 5-SAT

https://www.generacodice.com/jp/articolo/1612950/reduce-4-sat-to-5-sat
  np-complete  -  satisfiability  -  np-hard  -  time-complexity  -  polynomial-time
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

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
結果が見つかりました: 298
scroll top