タグnp-complete - これはページ7です - GeneraCodice

Is a reduction enough for proving NP-complete or do I need a transformation?

https://www.generacodice.com/jp/articolo/3651348/is-a-reduction-enough-for-proving-np-complete-or-do-i-need-a-transformation

complexity-theory - np-complete

Is a reduction enough for proving NP-complete or do I need a transformation?

https://www.generacodice.com/jp/articolo/3641964/is-a-reduction-enough-for-proving-np-complete-or-do-i-need-a-transformation

complexity-theory - np-complete

Shortest Paths with Resource Constraints

https://www.generacodice.com/jp/articolo/3559785/shortest-paths-with-resource-constraints

algorithm - np-complete - shortest-path

Np-hardness reduction

https://www.generacodice.com/jp/articolo/3437803/np-hardness-reduction

algorithm - np-complete - np-hard - np

Np-hardness reduction

https://www.generacodice.com/jp/articolo/3437789/np-hardness-reduction

algorithm - np-complete - np-hard - np

Np-hardness reduction

https://www.generacodice.com/jp/articolo/3437567/np-hardness-reduction

algorithm - np-complete - np-hard - np

Np-hardness reduction

https://www.generacodice.com/jp/articolo/3437177/np-hardness-reduction

algorithm - np-complete - np-hard - np

Effect of number base when proving NP completeness of numerical problems

https://www.generacodice.com/jp/articolo/3344090/effect-of-number-base-when-proving-np-completeness-of-numerical-problems

np-complete - subset-sum

Shortest Paths with Resource Constraints

https://www.generacodice.com/jp/articolo/3306681/shortest-paths-with-resource-constraints

algorithm - np-complete - shortest-path

How is 2-CNF SAT is in P, while 3-CNF SAT is in NPC?

https://www.generacodice.com/jp/articolo/3231248/how-is-2-cnf-sat-is-in-p-while-3-cnf-sat-is-in-npc

algorithm - np-complete - np

«
4
5
6
7
8
9
»

結果が見つかりました: 1372