Tag polynomial-time-reductions - This is page 1 - GeneraCodice

Reduction from VC to {a,k | a is a 3DNF (disjunctive normal form) and there exists an assignment satisfying exactly k clauses in a}

https://www.generacodice.com/en/articolo/2478310/reduction-from-vc-to-a-k-a-is-a-3dnf-disjunctive-normal-form-and-there-exists-an-assignment-satisfying-exactly-k-clauses-in-a
  complexity-theory  -  np-complete  -  check-my-answer  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Definition of NP-hardness for non-decision problems

https://www.generacodice.com/en/articolo/2476437/definition-of-np-hardness-for-non-decision-problems
  np-hard  -  definitions  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Converting a Mixed SUBSET-SUM Problem To All-Positive Case

https://www.generacodice.com/en/articolo/2474248/converting-a-mixed-subset-sum-problem-to-all-positive-case
  subset-sum  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

SAT satisfaction with 10 variables

https://www.generacodice.com/en/articolo/2474056/sat-satisfaction-with-10-variables
  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Confusion in Reduction of Hamiltonian-Path to Hamiltonian-Cycle

https://www.generacodice.com/en/articolo/2473071/confusion-in-reduction-of-hamiltonian-path-to-hamiltonian-cycle
  np-complete  -  graphs  -  hamiltonian-path  -  hamiltonian-circuit  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Is Monotone 3-SAT with exactly 3 distinct variables untractable?

https://www.generacodice.com/en/articolo/2472212/is-monotone-3-sat-with-exactly-3-distinct-variables-untractable
  np-complete  -  satisfiability  -  3-sat  -  propositional-logic  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Reducing 3-coloring problem to trio representatives

https://www.generacodice.com/en/articolo/2468967/reducing-3-coloring-problem-to-trio-representatives
  complexity-theory  -  np-complete  -  graphs  -  colorings  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Solving Exact2IS using IS

https://www.generacodice.com/en/articolo/2467541/solving-exact2is-using-is
  complexity-theory  -  computability  -  algorithms  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Prove finding k disjoint paths from n given paths in a directed graph is NP-complete

https://www.generacodice.com/en/articolo/2465802/prove-finding-k-disjoint-paths-from-n-given-paths-in-a-directed-graph-is-np-complete
  np-complete  -  np-hard  -  graphs  -  polynomial-time-reductions  -  directed-graphs
cs.stackexchange cs.stackexchange

Will this reduction of Exact Cover into Subset-Sum fail due to a potential false positive?

https://www.generacodice.com/en/articolo/2464517/will-this-reduction-of-exact-cover-into-subset-sum-fail-due-to-a-potential-false-positive
  set-cover  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange
Results found: 43
scroll top