علامة reductions - هذه الصفحة 95 - GeneraCodice

How to determine the polynomial runtime of an NP reduction?

https://www.generacodice.com/ar/articolo/1110550/how-to-determine-the-polynomial-runtime-of-an-np-reduction
  complexity-theory  -  np-complete  -  proof-techniques  -  reductions
cs.stackexchange cs.stackexchange

Graph 3-colorability is self-reducible

https://www.generacodice.com/ar/articolo/1110400/graph-3-colorability-is-self-reducible
  complexity-theory  -  reductions
cs.stackexchange cs.stackexchange

NP-complete reductions

https://www.generacodice.com/ar/articolo/1110178/np-complete-reductions
  complexity-theory  -  np-complete  -  terminology  -  reductions
cs.stackexchange cs.stackexchange

Optimization-factoring $\le_p$ Decision-factoring

https://www.generacodice.com/ar/articolo/1110139/optimization-factoring-le-p-decision-factoring
  optimization  -  reductions  -  factoring
cs.stackexchange cs.stackexchange

reducing subset-sum to partition

https://www.generacodice.com/ar/articolo/1110086/reducing-subset-sum-to-partition
  complexity-theory  -  np-complete  -  reductions  -  partitions
cs.stackexchange cs.stackexchange

Reducing the integer factorization problem to an NP-Complete problem

https://www.generacodice.com/ar/articolo/1108820/reducing-the-integer-factorization-problem-to-an-np-complete-problem
  np-complete  -  reductions  -  factoring
cs.stackexchange cs.stackexchange

Why does $A_\text{TM} \le_m \text{HALTING} \le_m \text{HALTING}^\varepsilon$?

https://www.generacodice.com/ar/articolo/1108714/why-does-a-text-tm-le-m-text-halting-le-m-text-halting-varepsilon
  turing-machines  -  halting-problem  -  undecidability  -  reductions
cs.stackexchange cs.stackexchange

Reduce the following problem to SAT

https://www.generacodice.com/ar/articolo/1108633/reduce-the-following-problem-to-sat
  complexity-theory  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

Reduction of A_LBA to E_LBA

https://www.generacodice.com/ar/articolo/1108619/reduction-of-a-lba-to-e-lba
  turing-machines  -  computability  -  undecidability  -  reductions
cs.stackexchange cs.stackexchange

Polynomial time reducibility

https://www.generacodice.com/ar/articolo/1108221/polynomial-time-reducibility
  complexity-theory  -  reductions  -  complexity-classes
cs.stackexchange cs.stackexchange
العثور على نتائج: 998
scroll top