Tag np-hard - This is page 7 - GeneraCodice

Proof for NP-hardness of simultaneous minimization and maximization of a weighted subset

https://www.generacodice.com/en/articolo/2471120/proof-for-np-hardness-of-simultaneous-minimization-and-maximization-of-a-weighted-subset
  np-complete  -  satisfiability  -  np-hard  -  np  -  3-sat
cs.stackexchange cs.stackexchange

How to prove NP-Completeness of longest path between two vertices relying Hamilton NP-Hard problem

https://www.generacodice.com/en/articolo/2468300/how-to-prove-np-completeness-of-longest-path-between-two-vertices-relying-hamilton-np-hard-problem
  complexity-theory  -  np-complete  -  np-hard  -  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

Having trouble understanding a proof of Mahaney’s theorem

https://www.generacodice.com/en/articolo/2465745/having-trouble-understanding-a-proof-of-mahaney-s-theorem
  complexity-theory  -  np-complete  -  satisfiability  -  np-hard  -  np
cs.stackexchange cs.stackexchange

2D packing in fixed dimensions rectangle

https://www.generacodice.com/en/articolo/2463974/2d-packing-in-fixed-dimensions-rectangle
  optimization  -  np-hard  -  algorithms
cs.stackexchange cs.stackexchange

How to prove finding two paths that are at least k edges apart is NP-hard?

https://www.generacodice.com/en/articolo/2463884/how-to-prove-finding-two-paths-that-are-at-least-k-edges-apart-is-np-hard
  np-hard  -  3-sat  -  graphs
cs.stackexchange cs.stackexchange

Disjoint union of NP-hard problem and P problem is NP-hard

https://www.generacodice.com/en/articolo/2463859/disjoint-union-of-np-hard-problem-and-p-problem-is-np-hard
  complexity-theory  -  np-hard
cs.stackexchange cs.stackexchange

Is the complexity of problems in NP exponential at most?

https://www.generacodice.com/en/articolo/2463514/is-the-complexity-of-problems-in-np-exponential-at-most
  complexity-theory  -  np-complete  -  np-hard
cs.stackexchange cs.stackexchange

Is P contained in NP-hard?

https://www.generacodice.com/en/articolo/2461916/is-p-contained-in-np-hard
  complexity-theory  -  np-hard  -  np
cs.stackexchange cs.stackexchange

Scheduling to minimize the truncated gaps

https://www.generacodice.com/en/articolo/2460090/scheduling-to-minimize-the-truncated-gaps
  np-hard  -  algorithms  -  reductions
cs.stackexchange cs.stackexchange
Results found: 647
scroll top