Tag reductions - This is page 99 - GeneraCodice

The $\text{k-key}$ problem

https://www.generacodice.com/en/articolo/1097503/the-text-k-key-problem
  complexity-theory  -  np-complete  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

Are there complete problems for P and NP under other kinds of reductions?

https://www.generacodice.com/en/articolo/1096719/are-there-complete-problems-for-p-and-np-under-other-kinds-of-reductions
  complexity-theory  -  reductions
cs.stackexchange cs.stackexchange

Complete Problems for $DSPACE(\log(n)^k)$

https://www.generacodice.com/en/articolo/1096469/complete-problems-for-dspace-log-n-k
  complexity-theory  -  space-complexity  -  reductions
cs.stackexchange cs.stackexchange

Mapping Reductions to Complement of A$_{TM}$

https://www.generacodice.com/en/articolo/1095603/mapping-reductions-to-complement-of-a-tm
  computability  -  proof-techniques  -  reductions
cs.stackexchange cs.stackexchange

Turing reducibility implies mapping reducibility

https://www.generacodice.com/en/articolo/1095496/turing-reducibility-implies-mapping-reducibility
  turing-machines  -  computability  -  reductions
cs.stackexchange cs.stackexchange

If A is mapping reducible to B then the complement of A is mapping reducible to the complement of B

https://www.generacodice.com/en/articolo/1095397/if-a-is-mapping-reducible-to-b-then-the-complement-of-a-is-mapping-reducible-to-the-complement-of-b
  complexity-theory  -  computability  -  reductions
cs.stackexchange cs.stackexchange

HALF CLIQUE - NP Complete Problem

https://www.generacodice.com/en/articolo/1093740/half-clique-np-complete-problem
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Reducing directed hamiltonian cycle to graph coloring

https://www.generacodice.com/en/articolo/1092894/reducing-directed-hamiltonian-cycle-to-graph-coloring
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange
Results found: 998
scroll top