Tag reductions - Esta é a página 10 - GeneraCodice

NP-completude para o programa linear inteiro

https://www.generacodice.com/pt/articolo/2444160/np-completude-para-o-programa-linear-inteiro
  np-complete  -  reductions  -  decision-problem
cs.stackexchange cs.stackexchange

Prove que o problema do Droid Trader é NP-completo

https://www.generacodice.com/pt/articolo/2443926/prove-que-o-problema-do-droid-trader-e-np-completo
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Ciclo Hamiltoniano, Verificando e Encontrando

https://www.generacodice.com/pt/articolo/2442702/ciclo-hamiltoniano-verificando-e-encontrando
  complexity-theory  -  reductions  -  hamiltonian-path
cs.stackexchange cs.stackexchange

Redução da tampa do vértice para dominar o conjunto

https://www.generacodice.com/pt/articolo/2441622/reducao-da-tampa-do-vertice-para-dominar-o-conjunto
  np-hard  -  correctness-proof  -  reductions  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

Example of two undecidable languages that cannot be reduced to each other

https://www.generacodice.com/pt/articolo/1811059/example-of-two-undecidable-languages-that-cannot-be-reduced-to-each-other
  turing-machines  -  automata  -  formal-languages  -  reductions
cs.stackexchange cs.stackexchange

How do we construct reductions for NP-Completeness

https://www.generacodice.com/pt/articolo/1810826/how-do-we-construct-reductions-for-np-completeness
  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Is finding the minimum feedback arc set on graph with two outgoing arcs for each node np-complete?

https://www.generacodice.com/pt/articolo/1810460/is-finding-the-minimum-feedback-arc-set-on-graph-with-two-outgoing-arcs-for-each-node-np-complete
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange

Reductions from non decision problems

https://www.generacodice.com/pt/articolo/1810070/reductions-from-non-decision-problems
  complexity-theory  -  np-complete  -  computability  -  approximation  -  reductions
cs.stackexchange cs.stackexchange

Partition into pairs with minimum absolute difference, NP-hard?

https://www.generacodice.com/pt/articolo/1809714/partition-into-pairs-with-minimum-absolute-difference-np-hard
  complexity-theory  -  np-hard  -  algorithms  -  reductions
cs.stackexchange cs.stackexchange

Can current quantum computers decide languages that Turing Machines cannot?

https://www.generacodice.com/pt/articolo/1809438/can-current-quantum-computers-decide-languages-that-turing-machines-cannot
  turing-machines  -  quantum-computing  -  undecidability  -  reductions  -  church-turing-thesis
cs.stackexchange cs.stackexchange
Resultados encontrados: 998
scroll top