علامة reductions - هذه الصفحة 9 - GeneraCodice

Is the Clique Problem polynomial time reducible to the graph-Homomorphism Problem and if so what does the reduction look like?

https://www.generacodice.com/ar/articolo/2447894/is-the-clique-problem-polynomial-time-reducible-to-the-graph-homomorphism-problem-and-if-so-what-does-the-reduction-look-like
  complexity-theory  -  np-complete  -  graphs  -  reductions
cs.stackexchange cs.stackexchange

يمكن أن يحدث متعدد الحدود متعددة إلى واحد على مثيل مشكلات محددة؟

https://www.generacodice.com/ar/articolo/2444506/يمكن-أن-يحدث-متعدد-الحدود-متعددة-إلى-واحد-على-مثيل-مشكلات-محددة
  complexity-theory  -  reductions
cs.stackexchange cs.stackexchange

NP-اكتمال البرنامج الخطي عدد صحيح

https://www.generacodice.com/ar/articolo/2444160/np-اكتمال-البرنامج-الخطي-عدد-صحيح
  np-complete  -  reductions  -  decision-problem
cs.stackexchange cs.stackexchange

إثبات مشكلة Troid Trader هي NP-Complete

https://www.generacodice.com/ar/articolo/2443926/إثبات-مشكلة-troid-trader-هي-np-complete
  complexity-theory  -  np-complete  -  reductions
cs.stackexchange cs.stackexchange

دورة هاميلتون، التحقق والإيجاد

https://www.generacodice.com/ar/articolo/2442702/دورة-هاميلتون-التحقق-والإيجاد
  complexity-theory  -  reductions  -  hamiltonian-path
cs.stackexchange cs.stackexchange

تخفيض من قمة الرأس إلى مجموعة المهيمنة

https://www.generacodice.com/ar/articolo/2441622/تخفيض-من-قمة-الرأس-إلى-مجموعة-المهيمنة
  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/ar/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/ar/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/ar/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/ar/articolo/1810070/reductions-from-non-decision-problems
  complexity-theory  -  np-complete  -  computability  -  approximation  -  reductions
cs.stackexchange cs.stackexchange
العثور على نتائج: 998
scroll top