Tag np-hard - Это страница 57 - GeneraCodice

How do we know that all NP problems reduce to NP-hard problems? [duplicate]

https://www.generacodice.com/ru/articolo/1490446/how-do-we-know-that-all-np-problems-reduce-to-np-hard-problems-duplicate
  complexity-theory  -  np-complete  -  np-hard
cs.stackexchange cs.stackexchange

3-SAT problem with number of clauses equal to number of variables

https://www.generacodice.com/ru/articolo/1490412/3-sat-problem-with-number-of-clauses-equal-to-number-of-variables
  complexity-theory  -  satisfiability  -  np-hard
cs.stackexchange cs.stackexchange

Is 0-1 integer linear programming NP-hard when $c^T$ is the all-ones vector?

https://www.generacodice.com/ru/articolo/1490242/is-0-1-integer-linear-programming-np-hard-when-c-t-is-the-all-ones-vector
  complexity-theory  -  linear-programming  -  np-hard
cs.stackexchange cs.stackexchange

How to prove the NP-completeness of the ``Exact-3D-Matching`` problem by reducing the ``3-Partition`` problem to it?

https://www.generacodice.com/ru/articolo/1490130/how-to-prove-the-np-completeness-of-the-exact-3d-matching-problem-by-reducing-the-3-partition-problem-to-it
  complexity-theory  -  np-complete  -  np-hard
cs.stackexchange cs.stackexchange

Prove the red blue separation problem is NP-complete

https://www.generacodice.com/ru/articolo/1489885/prove-the-red-blue-separation-problem-is-np-complete
  np-complete  -  np-hard  -  np  -  algorithms  -  algorithm-analysis
cs.stackexchange cs.stackexchange

Question on SAT reduction

https://www.generacodice.com/ru/articolo/1489850/question-on-sat-reduction
  complexity-theory  -  np-complete  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

Proving $ \{ \langle D_1, … ,D_K \rangle : \text{ where } D_i \text{ are DFAs and } {\bigcap}_{i=1}^k L(D_i) = \emptyset \} $ is NP-Hard

https://www.generacodice.com/ru/articolo/1489269/proving-langle-d-1-d-k-rangle-text-where-d-i-text-are-dfas-and-bigcap-i-1-k-l-d-i-emptyset-is-np-hard
  complexity-theory  -  np-hard
cs.stackexchange cs.stackexchange

Having trouble proving a language is NP-complete

https://www.generacodice.com/ru/articolo/1489264/having-trouble-proving-a-language-is-np-complete
  complexity-theory  -  np-complete  -  np-hard  -  np
cs.stackexchange cs.stackexchange

Can Euclidean TSP be exactly solved in time better than (sym)metric TSP?

https://www.generacodice.com/ru/articolo/1488854/can-euclidean-tsp-be-exactly-solved-in-time-better-than-sym-metric-tsp
  np-hard  -  time-complexity  -  traveling-salesman  -  reference-request  -  graphs
cs.stackexchange cs.stackexchange

Transforming SAT to Quadratic Programming in polynomial time

https://www.generacodice.com/ru/articolo/1488425/transforming-sat-to-quadratic-programming-in-polynomial-time
  complexity-theory  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange
Результаты найдены: 647
scroll top