标签polynomial-time-reductions - 这是页1 - GeneraCodice

从VC减少到{a，k |A是3DNF（分离正常形式），并且存在令人满意的k条款的作业

https://www.generacodice.com/cn/articolo/2478310/从vc减少到-a-k-a是3dnf-分离正常形式-并且存在令人满意的k条款的作业
  complexity-theory  -  np-complete  -  check-my-answer  -  polynomial-time-reductions
cs.stackexchange 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 cs.stackexchange

将混合子集合问题转换为全面情况

https://www.generacodice.com/cn/articolo/2474248/将混合子集合问题转换为全面情况
  subset-sum  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

与10个变量满意

https://www.generacodice.com/cn/articolo/2474056/与10个变量满意
  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Confusion in Reduction of Hamiltonian-Path to Hamiltonian-Cycle

https://www.generacodice.com/cn/articolo/2473071/confusion-in-reduction-of-hamiltonian-path-to-hamiltonian-cycle
  np-complete  -  graphs  -  hamiltonian-path  -  hamiltonian-circuit  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

具有 3 个不同变量的 Monotone 3-SAT 是否难以处理？

https://www.generacodice.com/cn/articolo/2472212/具有-3-个不同变量的-monotone-3-sat-是否难以处理
  np-complete  -  satisfiability  -  3-sat  -  propositional-logic  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

减少三重奏代表的3色问题

https://www.generacodice.com/cn/articolo/2468967/减少三重奏代表的3色问题
  complexity-theory  -  np-complete  -  graphs  -  colorings  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

解决Exclut2is使用是

https://www.generacodice.com/cn/articolo/2467541/解决exclut2is使用是
  complexity-theory  -  computability  -  algorithms  -  polynomial-time-reductions
cs.stackexchange 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 cs.stackexchange

由于潜在的假阳性，这种情况会将精确的覆盖物减少到子集中的情况下吗？

https://www.generacodice.com/cn/articolo/2464517/由于潜在的假阳性-这种情况会将精确的覆盖物减少到子集中的情况下吗
  set-cover  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange
发现结果: 43
scroll top