Tag reductions - This is page 98 - GeneraCodice

How are all NP Complete problems similar?

https://www.generacodice.com/en/articolo/1098537/how-are-all-np-complete-problems-similar
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Showing that the set of TMs which visit the starting state twice on the empty input is undecidable

https://www.generacodice.com/en/articolo/1098004/showing-that-the-set-of-tms-which-visit-the-starting-state-twice-on-the-empty-input-is-undecidable
  turing-machines  -  halting-problem  -  undecidability  -  reductions
cs.stackexchange cs.stackexchange

A polynomial reduction from any NP-complete problem to bounded PCP

https://www.generacodice.com/en/articolo/1097691/a-polynomial-reduction-from-any-np-complete-problem-to-bounded-pcp
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Is SAT in P if there are exponentially many clauses in the number of variables?

https://www.generacodice.com/en/articolo/1097555/is-sat-in-p-if-there-are-exponentially-many-clauses-in-the-number-of-variables
  complexity-theory  -  np-complete  -  satisfiability  -  reductions  -  polynomial-time
cs.stackexchange cs.stackexchange

Is Karp Reduction identical to Levin Reduction

https://www.generacodice.com/en/articolo/1097529/is-karp-reduction-identical-to-levin-reduction
  complexity-theory  -  reductions  -  check-my-proof
cs.stackexchange cs.stackexchange

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
Results found: 998
scroll top