علامة polynomial-time - هذه الصفحة 4 - GeneraCodice

الخوارزميات التي تعمل في وقت متعدد الحدود إذا P= NP

https://www.generacodice.com/ar/articolo/2458475/الخوارزميات-التي-تعمل-في-وقت-متعدد-الحدود-إذا-p-np
  time-complexity  -  algorithms  -  decision-problem  -  p-vs-np  -  polynomial-time
cs.stackexchange cs.stackexchange

حجة في إثبات أن الوظيفة ليست وقت متعدد الحدود في طول الإدخال يبدو خلل

https://www.generacodice.com/ar/articolo/2455107/حجة-في-إثبات-أن-الوظيفة-ليست-وقت-متعدد-الحدود-في-طول-الإدخال-يبدو-خلل
  complexity-theory  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

هل اللغة المحددة في التفاصيل في NP-C أو P؟

https://www.generacodice.com/ar/articolo/2454736/هل-اللغة-المحددة-في-التفاصيل-في-np-c-أو-p
  complexity-theory  -  np-complete  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

How undecidable is it whether a given Turing machine runs in polynomial time?

https://www.generacodice.com/ar/articolo/1809275/how-undecidable-is-it-whether-a-given-turing-machine-runs-in-polynomial-time
  computability  -  undecidability  -  polynomial-time
cs.stackexchange cs.stackexchange

Simple Hamiltonian cycle reduction

https://www.generacodice.com/ar/articolo/1615513/simple-hamiltonian-cycle-reduction
  np-complete  -  polynomial-time
cs.stackexchange cs.stackexchange

Number of equivalence classes in $P$

https://www.generacodice.com/ar/articolo/1613709/number-of-equivalence-classes-in-p
  complexity-theory  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

is $x^{100000000000}$ a “polynomial time”?

https://www.generacodice.com/ar/articolo/1613479/is-x-100000000000-a-polynomial-time
  polynomial-time
cs.stackexchange cs.stackexchange

Reduce 4-SAT to 5-SAT

https://www.generacodice.com/ar/articolo/1612950/reduce-4-sat-to-5-sat
  np-complete  -  satisfiability  -  np-hard  -  time-complexity  -  polynomial-time
cs.stackexchange cs.stackexchange

Is a “local” version of 3-SAT NP-hard?

https://www.generacodice.com/ar/articolo/1612712/is-a-local-version-of-3-sat-np-hard
  satisfiability  -  np-hard  -  3-sat  -  polynomial-time  -  2-sat
cs.stackexchange cs.stackexchange

Polynomial Time reducible explanation

https://www.generacodice.com/ar/articolo/1609765/polynomial-time-reducible-explanation
  formal-languages  -  reductions  -  polynomial-time
cs.stackexchange cs.stackexchange
العثور على نتائج: 298
scroll top