Tag np-hard - Esta é a página 62 - GeneraCodice

Does Max-SNP hard imply NP-hard

https://www.generacodice.com/pt/articolo/1108824/does-max-snp-hard-imply-np-hard
  complexity-theory  -  np-hard
cs.stackexchange cs.stackexchange

Reduce the following problem to SAT

https://www.generacodice.com/pt/articolo/1108633/reduce-the-following-problem-to-sat
  complexity-theory  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

Modification of Hamilton Path

https://www.generacodice.com/pt/articolo/1108478/modification-of-hamilton-path
  graph-theory  -  complexity-theory  -  np-hard  -  algorithms
cs.stackexchange cs.stackexchange

What is the relationship between NP/NP-Complete/NP-Hard to time complexity?

https://www.generacodice.com/pt/articolo/1102848/what-is-the-relationship-between-np-np-complete-np-hard-to-time-complexity
  complexity-theory  -  terminology  -  np-hard  -  time-complexity
cs.stackexchange cs.stackexchange

The $\text{k-key}$ problem

https://www.generacodice.com/pt/articolo/1097503/the-text-k-key-problem
  complexity-theory  -  np-complete  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

A continuous optimization problem that reduces to TSP

https://www.generacodice.com/pt/articolo/1093664/a-continuous-optimization-problem-that-reduces-to-tsp
  optimization  -  complexity-theory  -  np-hard  -  computable-analysis
cs.stackexchange cs.stackexchange

Proving that directed graph diagnosis is NP-hard

https://www.generacodice.com/pt/articolo/1092793/proving-that-directed-graph-diagnosis-is-np-hard
  graph-theory  -  complexity-theory  -  np-hard
cs.stackexchange cs.stackexchange

Decision problems vs “real” problems that aren't yes-or-no

https://www.generacodice.com/pt/articolo/1091949/decision-problems-vs-real-problems-that-aren-t-yes-or-no
  complexity-theory  -  approximation  -  np-hard  -  time-complexity
cs.stackexchange cs.stackexchange

Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?

https://www.generacodice.com/pt/articolo/1091693/why-hasn-t-there-been-an-encryption-algorithm-that-is-based-on-the-known-np-hard-problems
  encryption  -  complexity-theory  -  cryptography  -  np-hard
cs.stackexchange cs.stackexchange

Easy reduction from 3SAT to Hamiltonian path problem

https://www.generacodice.com/pt/articolo/1091425/easy-reduction-from-3sat-to-hamiltonian-path-problem
  complexity-theory  -  np-hard
cs.stackexchange cs.stackexchange
Resultados encontrados: 647
scroll top