Tag reductions - This is page 7 - GeneraCodice

Reductions to and from PRIME

https://www.generacodice.com/en/articolo/2456398/reductions-to-and-from-prime
  reductions
cs.stackexchange cs.stackexchange

Equivalence between MIN UNCUT and MIN-CSP_XOR

https://www.generacodice.com/en/articolo/2456016/equivalence-between-min-uncut-and-min-csp-xor
  constraint-satisfaction  -  reductions  -  bipartite-graph
cs.stackexchange cs.stackexchange

Hardness of a scheduling/assignment problem

https://www.generacodice.com/en/articolo/2452798/hardness-of-a-scheduling-assignment-problem
  scheduling  -  np-hard  -  algorithms  -  reductions  -  bipartite-matching
cs.stackexchange cs.stackexchange

IS there a consensus on the definition of a computer program in CS literature and if so, what is it?

https://www.generacodice.com/en/articolo/2452522/is-there-a-consensus-on-the-definition-of-a-computer-program-in-cs-literature-and-if-so-what-is-it
  terminology  -  reductions
cs.stackexchange cs.stackexchange

Two versions of Subset Sum Problem

https://www.generacodice.com/en/articolo/2452373/two-versions-of-subset-sum-problem
  complexity-theory  -  np-complete  -  subset-sum  -  reductions
cs.stackexchange cs.stackexchange

Reduce $L_c=\{\langle M_1 \rangle, \langle M_2 \rangle):L(M_1)\cap L(M_2)\neq \emptyset\}$ to $A_{TM} $

https://www.generacodice.com/en/articolo/2450771/reduce-l-c-langle-m-1-rangle-langle-m-2-rangle-l-m-1-cap-l-m-2-neq-emptyset-to-a-tm
  complexity-theory  -  turing-machines  -  computability  -  reductions
cs.stackexchange cs.stackexchange

why does $ A≤_p \#SAT$ if $A \in BPP$

https://www.generacodice.com/en/articolo/2450565/why-does-a-p-sat-if-a-in-bpp
  complexity-theory  -  turing-machines  -  computability  -  reductions  -  probabilistic-turing-machines
cs.stackexchange cs.stackexchange

Is the number of NP-complete problems finite?

https://www.generacodice.com/en/articolo/2449966/is-the-number-of-np-complete-problems-finite
  complexity-theory  -  np-complete  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

if there is no reduction from A to B

https://www.generacodice.com/en/articolo/2448353/if-there-is-no-reduction-from-a-to-b
  computability  -  reductions
cs.stackexchange cs.stackexchange

Is the Clique Problem polynomial time reducible to the graph-Homomorphism Problem and if so what does the reduction look like?

https://www.generacodice.com/en/articolo/2447894/is-the-clique-problem-polynomial-time-reducible-to-the-graph-homomorphism-problem-and-if-so-what-does-the-reduction-look-like
  complexity-theory  -  np-complete  -  graphs  -  reductions
cs.stackexchange cs.stackexchange
Results found: 998
scroll top