标签np-hard - 这是页5 - GeneraCodice

Scheduling: P||Cmax

https://www.generacodice.com/cn/articolo/3103686/scheduling-p-cmax

  algorithm  -  scheduling  -  np-hard

StackOverflow

是否存在NP难题，其中不存在固定参数易遗传算法？

https://www.generacodice.com/cn/articolo/2477460/是否存在np难题-其中不存在固定参数易遗传算法

  complexity-theory  -  np-hard  -  parameterized-complexity

cs.stackexchange

Definition of NP-hardness for non-decision problems

https://www.generacodice.com/cn/articolo/2476437/definition-of-np-hardness-for-non-decision-problems

  np-hard  -  definitions  -  polynomial-time-reductions

cs.stackexchange

If P=NP, does this imply that all problems are NP-hard?

https://www.generacodice.com/cn/articolo/2476398/if-p-np-does-this-imply-that-all-problems-are-np-hard

  complexity-theory  -  np-hard  -  p-vs-np

cs.stackexchange

计算简单路径的平均长度的算法

https://www.generacodice.com/cn/articolo/2473735/计算简单路径的平均长度的算法

  np-hard  -  algorithms  -  graphs

cs.stackexchange

$偶数$ $ $ $ -hard吗？

https://www.generacodice.com/cn/articolo/2473417/偶数-hard吗

  complexity-theory  -  np-hard

cs.stackexchange

关于同时最小化的NP硬度和加权子集最大化的证明

https://www.generacodice.com/cn/articolo/2471120/关于同时最小化的np硬度和加权子集最大化的证明

  np-complete  -  satisfiability  -  np-hard  -  np  -  3-sat

cs.stackexchange

如何证明两个顶点之间最长路径的NP完整性依赖汉密尔顿NP-HARD问题

https://www.generacodice.com/cn/articolo/2468300/如何证明两个顶点之间最长路径的np完整性依赖汉密尔顿np-hard问题

  complexity-theory  -  np-complete  -  np-hard  -  reductions

cs.stackexchange

证明在指向图中的N给定路径中发现k个不相交路径是np-complete

https://www.generacodice.com/cn/articolo/2465802/证明在指向图中的n给定路径中发现k个不相交路径是np-complete

  np-complete  -  np-hard  -  graphs  -  polynomial-time-reductions  -  directed-graphs

cs.stackexchange

Having trouble understanding a proof of Mahaney’s theorem

https://www.generacodice.com/cn/articolo/2465745/having-trouble-understanding-a-proof-of-mahaney-s-theorem

  complexity-theory  -  np-complete  -  satisfiability  -  np-hard  -  np

cs.stackexchange

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

发现结果: 647