Tag np-hard - This is page 5 - GeneraCodice

Scheduling: P||Cmax

https://www.generacodice.com/en/articolo/3103686/scheduling-p-cmax
  algorithm  -  scheduling  -  np-hard
StackOverflow StackOverflow

Is there an NP-hard problem for which no Fixed-Parameter Tractable algorithm exists?

https://www.generacodice.com/en/articolo/2477460/is-there-an-np-hard-problem-for-which-no-fixed-parameter-tractable-algorithm-exists
  complexity-theory  -  np-hard  -  parameterized-complexity
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

If P=NP, does this imply that all problems are NP-hard?

https://www.generacodice.com/en/articolo/2476398/if-p-np-does-this-imply-that-all-problems-are-np-hard
  complexity-theory  -  np-hard  -  p-vs-np
cs.stackexchange cs.stackexchange

Algorithm to compute average length of a simple path

https://www.generacodice.com/en/articolo/2473735/algorithm-to-compute-average-length-of-a-simple-path
  np-hard  -  algorithms  -  graphs
cs.stackexchange cs.stackexchange

Is $EVEN-SAT$ $NP$-hard?

https://www.generacodice.com/en/articolo/2473417/is-even-sat-np-hard
  complexity-theory  -  np-hard
cs.stackexchange cs.stackexchange

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
Results found: 647
scroll top