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

Verification algorithm for minimum vertex cover?

https://www.generacodice.com/jp/articolo/7418515/verification-algorithm-for-minimum-vertex-cover

  algorithm  -  graph  -  np-complete  -  vertex

StackOverflow

Boolean formula encoding

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

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

StackOverflow

NP-complete, no efficient algorithm?

https://www.generacodice.com/jp/articolo/6945022/np-complete-no-efficient-algorithm

  performance  -  np-complete

StackOverflow

Where to find a set of hard Traveling Salesman Problems (with known solutions/approximations)?

https://www.generacodice.com/jp/articolo/6756046/where-to-find-a-set-of-hard-traveling-salesman-problems-with-known-solutions-approximations

  algorithm  -  language-agnostic  -  np-complete  -  np-hard  -  traveling-salesman

StackOverflow

Double exponential problems? [closed]

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

  algorithm  -  np-complete  -  np

StackOverflow

Is it necessary for NP problems to be decision problems ?

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

  algorithm  -  np-complete  -  np

StackOverflow

NP class : Why polynomial length outputs?

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

  algorithm  -  np-complete  -  np

StackOverflow

Reduction of Leaf constrained MST p‌r‌o‌b‌l‌e‌m to Hamiltonian path p‌r‌o‌b‌l‌e‌m

https://www.generacodice.com/jp/articolo/6354721/reduction-of-leaf-constrained-mst-p-r-o-b-l-e-m-to-hamiltonian-path-p-r-o-b-l-e-m

  algorithm  -  graph-theory  -  graph-algorithm  -  np-complete  -  minimum-spanning-tree

StackOverflow

Is it compulsory that the 'reduction of p‌r‌o‌b‌l‌e‌m be done in polynomial time' for it to be NP complete?

https://www.generacodice.com/jp/articolo/6350968/is-it-compulsory-that-the-reduction-of-p-r-o-b-l-e-m-be-done-in-polynomial-time-for-it-to-be-np-complete

  algorithm  -  np-complete  -  np

StackOverflow

can some sorting be P, NP, and NP-Complete?

https://www.generacodice.com/jp/articolo/5596403/can-some-sorting-be-p-np-and-np-complete

  algorithm  -  sorting  -  np-complete  -  p-np  -  np

StackOverflow

• «
• 1
• 2
• 3
• 4
• 5
• 6
• »

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