علامة p-vs-np - هذه الصفحة 18 - GeneraCodice

$1+\epsilon$ approximation for inapproximable problems

https://www.generacodice.com/ar/articolo/1119278/1-epsilon-approximation-for-inapproximable-problems
  complexity-theory  -  np-complete  -  approximation  -  p-vs-np  -  parameterized-complexity
cs.stackexchange cs.stackexchange

Is the open question NP=co-NP the same as P=NP?

https://www.generacodice.com/ar/articolo/1118466/is-the-open-question-np-co-np-the-same-as-p-np
  complexity-theory  -  p-vs-np  -  complexity-classes
cs.stackexchange cs.stackexchange

Is it necessary for NP problems to be decision problems?

https://www.generacodice.com/ar/articolo/1118245/is-it-necessary-for-np-problems-to-be-decision-problems
  np  -  algorithms  -  p-vs-np
cs.stackexchange cs.stackexchange

What is the definition of P, NP, NP-complete and NP-hard?

https://www.generacodice.com/ar/articolo/1117981/what-is-the-definition-of-p-np-np-complete-and-np-hard
  complexity-theory  -  terminology  -  reference-question  -  p-vs-np  -  complexity-classes
cs.stackexchange cs.stackexchange

Proving P = NP without mathematical statements / computer program

https://www.generacodice.com/ar/articolo/1112006/proving-p-np-without-mathematical-statements-computer-program
  complexity-theory  -  p-vs-np
cs.stackexchange cs.stackexchange

Implications of polynomial time reductions

https://www.generacodice.com/ar/articolo/1111330/implications-of-polynomial-time-reductions
  complexity-theory  -  reductions  -  p-vs-np  -  complexity-classes
cs.stackexchange cs.stackexchange

Proving that if $\mathrm{NTime}(n^{100}) \subseteq \mathrm{DTime}(n^{1000})$ then $\mathrm{P}=\mathrm{NP}$

https://www.generacodice.com/ar/articolo/1109654/proving-that-if-mathrm-ntime-n-100-subseteq-mathrm-dtime-n-1000-then-mathrm-p-mathrm-np
  time-complexity  -  p-vs-np  -  complexity-classes
cs.stackexchange cs.stackexchange

How can P =? NP enhance integer factorization

https://www.generacodice.com/ar/articolo/1109550/how-can-p-np-enhance-integer-factorization
  complexity-theory  -  np-complete  -  computability  -  p-vs-np  -  factoring
cs.stackexchange cs.stackexchange

Can exactly one of NP and co-NP be equal to P?

https://www.generacodice.com/ar/articolo/1096927/can-exactly-one-of-np-and-co-np-be-equal-to-p
  complexity-theory  -  p-vs-np
cs.stackexchange cs.stackexchange

Are there NP problems, not in P and not NP Complete?

https://www.generacodice.com/ar/articolo/1095976/are-there-np-problems-not-in-p-and-not-np-complete
  complexity-theory  -  np-complete  -  p-vs-np
cs.stackexchange cs.stackexchange
العثور على نتائج: 190
scroll top