标签np - 这是页5 - GeneraCodice

Using NP Reductions

https://www.generacodice.com/cn/articolo/7812907/using-np-reductions

cycle - reduction - np

Find a vertex disjoint path from source to destination

https://www.generacodice.com/cn/articolo/7614864/find-a-vertex-disjoint-path-from-source-to-destination

algorithm - graph-theory - np

Is the variation of Knapsack NP-Complete?

https://www.generacodice.com/cn/articolo/7443165/is-the-variation-of-knapsack-np-complete

math - algorithm - optimization - np

NP-Complete Graph optimization: minimal node selection?

https://www.generacodice.com/cn/articolo/7417429/np-complete-graph-optimization-minimal-node-selection

algorithm - optimization - graph - reduction - np

Boolean formula encoding

https://www.generacodice.com/cn/articolo/7330570/boolean-formula-encoding

math - np-complete - satisfiability - np-hard - np

Is there a graph coloring algorithm where limits can be placed on number of vertices per color

https://www.generacodice.com/cn/articolo/7314370/is-there-a-graph-coloring-algorithm-where-limits-can-be-placed-on-number-of-vertices-per-color

algorithm - colors - graph - np - graph-coloring

Is "house coloring with three colors" NP?

https://www.generacodice.com/cn/articolo/7019899/is-house-coloring-with-three-colors-np

algorithm - language-agnostic - complexity-theory - dynamic-programming - np

Double exponential problems? [closed]

https://www.generacodice.com/cn/articolo/6372376/double-exponential-problems-closed

algorithm - np-complete - np

Is it necessary for NP problems to be decision problems ?

https://www.generacodice.com/cn/articolo/6358240/is-it-necessary-for-np-problems-to-be-decision-problems

algorithm - np-complete - np

NP class : Why polynomial length outputs?

https://www.generacodice.com/cn/articolo/6357937/np-class-why-polynomial-length-outputs

algorithm - np-complete - np

«
2
3
4
5
6
7
»

发现结果: 620