Tag reductions - This is page 9 - GeneraCodice

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

Can polynomial many-to-one reduction be done to a specific problem instance?

https://www.generacodice.com/en/articolo/2444506/can-polynomial-many-to-one-reduction-be-done-to-a-specific-problem-instance
  complexity-theory  -  reductions
cs.stackexchange cs.stackexchange

NP-completeness for integer linear program

https://www.generacodice.com/en/articolo/2444160/np-completeness-for-integer-linear-program
  np-complete  -  reductions  -  decision-problem
cs.stackexchange cs.stackexchange

Prove the Droid Trader Problem is NP-complete

https://www.generacodice.com/en/articolo/2443926/prove-the-droid-trader-problem-is-np-complete
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Hamiltonian cycle, verifying and finding

https://www.generacodice.com/en/articolo/2442702/hamiltonian-cycle-verifying-and-finding
  complexity-theory  -  reductions  -  hamiltonian-path
cs.stackexchange cs.stackexchange

Reduction from Vertex Cover to Dominating Set

https://www.generacodice.com/en/articolo/2441622/reduction-from-vertex-cover-to-dominating-set
  np-hard  -  correctness-proof  -  reductions  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Example of two undecidable languages that cannot be reduced to each other

https://www.generacodice.com/en/articolo/1811059/example-of-two-undecidable-languages-that-cannot-be-reduced-to-each-other
  turing-machines  -  automata  -  formal-languages  -  reductions
cs.stackexchange cs.stackexchange

How do we construct reductions for NP-Completeness

https://www.generacodice.com/en/articolo/1810826/how-do-we-construct-reductions-for-np-completeness
  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Is finding the minimum feedback arc set on graph with two outgoing arcs for each node np-complete?

https://www.generacodice.com/en/articolo/1810460/is-finding-the-minimum-feedback-arc-set-on-graph-with-two-outgoing-arcs-for-each-node-np-complete
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Reductions from non decision problems

https://www.generacodice.com/en/articolo/1810070/reductions-from-non-decision-problems
  complexity-theory  -  np-complete  -  computability  -  approximation  -  reductions
cs.stackexchange cs.stackexchange
Results found: 998
scroll top