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

How can an algorithm have exponential space complexity but polynomial time complexity?

https://www.generacodice.com/jp/articolo/1518568/how-can-an-algorithm-have-exponential-space-complexity-but-polynomial-time-complexity
  complexity-theory  -  time-complexity  -  space-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

Understanding the Sipser-Gacs-Lautemann theorem

https://www.generacodice.com/jp/articolo/1518103/understanding-the-sipser-gacs-lautemann-theorem
  complexity-theory  -  probabilistic-algorithms  -  complexity-classes  -  polynomial-time
cs.stackexchange cs.stackexchange

Why is Ibarra Kim for 0/1 knapsack an fully polynomial time approximation scheme (FPTAS)?

https://www.generacodice.com/jp/articolo/1517745/why-is-ibarra-kim-for-0-1-knapsack-an-fully-polynomial-time-approximation-scheme-fptas
  approximation  -  algorithm-analysis  -  runtime-analysis  -  knapsack-problems  -  polynomial-time
cs.stackexchange cs.stackexchange

Complexity of the decision version of determining a min-cut

https://www.generacodice.com/jp/articolo/1515836/complexity-of-the-decision-version-of-determining-a-min-cut
  complexity-theory  -  time-complexity  -  graphs  -  network-flow  -  polynomial-time
cs.stackexchange cs.stackexchange

A Reduction from XORSAT to 2-SAT

https://www.generacodice.com/jp/articolo/1515731/a-reduction-from-xorsat-to-2-sat
  complexity-theory  -  satisfiability  -  reductions  -  polynomial-time
cs.stackexchange cs.stackexchange

Finding number not in list with wildcards

https://www.generacodice.com/jp/articolo/1512013/finding-number-not-in-list-with-wildcards
  algorithms  -  lists  -  polynomial-time
cs.stackexchange cs.stackexchange

Unary in $P$, binary not in $P$

https://www.generacodice.com/jp/articolo/1511812/unary-in-p-binary-not-in-p
  complexity-theory  -  polynomial-time
cs.stackexchange cs.stackexchange

How to prove that problem is not in P

https://www.generacodice.com/jp/articolo/1510333/how-to-prove-that-problem-is-not-in-p
  complexity-theory  -  proof-techniques  -  polynomial-time
cs.stackexchange cs.stackexchange

A variant of the set cover problem: Is that a known problem?

https://www.generacodice.com/jp/articolo/1510291/a-variant-of-the-set-cover-problem-is-that-a-known-problem
  complexity-theory  -  algorithms  -  decision-problem  -  polynomial-time
cs.stackexchange cs.stackexchange

Can't understand why the DP Subset Sum algorithm is not polynomial

https://www.generacodice.com/jp/articolo/1496477/can-t-understand-why-the-dp-subset-sum-algorithm-is-not-polynomial
  complexity-theory  -  np-complete  -  terminology  -  dynamic-programming  -  polynomial-time
cs.stackexchange cs.stackexchange
結果が見つかりました: 298
scroll top