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

Hardness of approximation of the 3 colorability problem

https://www.generacodice.com/pt/articolo/1122310/hardness-of-approximation-of-the-3-colorability-problem
  approximation  -  np-hard  -  algorithms
cs.stackexchange cs.stackexchange

Generating 3SAT circuit for Integer factorization example

https://www.generacodice.com/pt/articolo/1122195/generating-3sat-circuit-for-integer-factorization-example
  np-hard  -  3-sat  -  factoring
cs.stackexchange cs.stackexchange

Show that this language is in NP $\cap$ coNP

https://www.generacodice.com/pt/articolo/1122147/show-that-this-language-is-in-np-cap-conp
  np-hard  -  np
cs.stackexchange cs.stackexchange

NP hardness through Restriction

https://www.generacodice.com/pt/articolo/1121541/np-hardness-through-restriction
  complexity-theory  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

Is Hidoku NP complete?

https://www.generacodice.com/pt/articolo/1121249/is-hidoku-np-complete
  complexity-theory  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

Do any decision problems exist outside NP and NP-Hard?

https://www.generacodice.com/pt/articolo/1120520/do-any-decision-problems-exist-outside-np-and-np-hard
  complexity-theory  -  np-complete  -  np-hard  -  decision-problem  -  complexity-classes
cs.stackexchange cs.stackexchange

Subset Sum: reduce special to general case

https://www.generacodice.com/pt/articolo/1120473/subset-sum-reduce-special-to-general-case
  complexity-theory  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

How to reduce from subset-sum problem?

https://www.generacodice.com/pt/articolo/1120096/how-to-reduce-from-subset-sum-problem
  complexity-theory  -  np-hard  -  reductions
cs.stackexchange cs.stackexchange

How to prove NP-hardness of a longest-path problem?

https://www.generacodice.com/pt/articolo/1120076/how-to-prove-np-hardness-of-a-longest-path-problem
  complexity-theory  -  np-hard  -  proof-techniques  -  reductions
cs.stackexchange cs.stackexchange

NP-Hard problems that are not in NP but decidable

https://www.generacodice.com/pt/articolo/1116883/np-hard-problems-that-are-not-in-np-but-decidable
  complexity-theory  -  computability  -  np-hard
cs.stackexchange cs.stackexchange
Resultados encontrados: 647
scroll top