علامة pseudo-polynomial - هذه الصفحة 1 - GeneraCodice

0-1 napsack دون تكرار

https://www.generacodice.com/ar/articolo/2461415/0-1-napsack-دون-تكرار
  time-complexity  -  knapsack-problems  -  polynomial-time  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

مشكلة napsack مع قيود رقم العنصر المطلوبة بالضبط

https://www.generacodice.com/ar/articolo/2458134/مشكلة-napsack-مع-قيود-رقم-العنصر-المطلوبة-بالضبط
  optimization  -  algorithms  -  knapsack-problems  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

How can I develop a pseudo-polynomial time algorithm for a non-integer problem?

https://www.generacodice.com/ar/articolo/1611059/how-can-i-develop-a-pseudo-polynomial-time-algorithm-for-a-non-integer-problem
  complexity-theory  -  scheduling  -  np-hard  -  real-numbers  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

Solve PARTITION-INTO-THREE-SETS in pseudo-polynomial time

https://www.generacodice.com/ar/articolo/1607650/solve-partition-into-three-sets-in-pseudo-polynomial-time
  complexity-theory  -  np-complete  -  dynamic-programming  -  partitions  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

Psedu-polynomial Time : Conflict with the definition of input size

https://www.generacodice.com/ar/articolo/1593732/psedu-polynomial-time-conflict-with-the-definition-of-input-size
  time-complexity  -  algorithm-analysis  -  runtime-analysis  -  knapsack-problems  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

Solving Subset Sum Without the Use of Dynamic Programming

https://www.generacodice.com/ar/articolo/1589828/solving-subset-sum-without-the-use-of-dynamic-programming
  np-hard  -  subset-sum  -  algorithms  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

How is integer factoring not in $P$?

https://www.generacodice.com/ar/articolo/1587109/how-is-integer-factoring-not-in-p
  complexity-theory  -  factoring  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

Shouldn't every algorithm run in pseudo-polynomial time?

https://www.generacodice.com/ar/articolo/1579332/shouldn-t-every-algorithm-run-in-pseudo-polynomial-time
  complexity-theory  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

Common subset sum fast algorithm

https://www.generacodice.com/ar/articolo/1568999/common-subset-sum-fast-algorithm
  algorithms  -  pseudo-polynomial
cs.stackexchange cs.stackexchange

Why is the dynamic programming algorithm of the knapsack problem not polynomial? [duplicate]

https://www.generacodice.com/ar/articolo/1563519/why-is-the-dynamic-programming-algorithm-of-the-knapsack-problem-not-polynomial-duplicate
  dynamic-programming  -  algorithm-analysis  -  runtime-analysis  -  knapsack-problems  -  pseudo-polynomial
cs.stackexchange cs.stackexchange
العثور على نتائج: 28
scroll top