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

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

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

KARP从优化问题减少到决策问题

https://www.generacodice.com/cn/articolo/2463841/karp从优化问题减少到决策问题
  np-complete  -  np  -  reductions  -  decision-problem  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

限制饱于CNF

https://www.generacodice.com/cn/articolo/2454658/限制饱于cnf
  np-complete  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

是否有这样的概念是“有效可计算的减少”，或者这不会有用

https://www.generacodice.com/cn/articolo/2453152/是否有这样的概念是-有效可计算的减少-或者这不会有用
  theory  -  complexity-theory  -  computability  -  np  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

多项式归约和 CONP 完成

https://www.generacodice.com/cn/articolo/2451385/多项式归约和-conp-完成
  np-complete  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

从顶点盖减少到主导集合

https://www.generacodice.com/cn/articolo/2441622/从顶点盖减少到主导集合
  np-hard  -  correctness-proof  -  reductions  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Are every problems in EXP karp reducible to any EXP-Complete?

https://www.generacodice.com/cn/articolo/1616267/are-every-problems-in-exp-karp-reducible-to-any-exp-complete
  algorithms  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

CLIQUE $\leq_p$ SAT

https://www.generacodice.com/cn/articolo/1616200/clique-leq-p-sat
  clique  -  satisfiability  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

weighted-clique to vertex cover reduction

https://www.generacodice.com/cn/articolo/1615347/weighted-clique-to-vertex-cover-reduction
  np-hard  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange
发现结果: 43
scroll top