Tag np - Esta é a página 6 - GeneraCodice

Double exponential problems? [closed]

https://www.generacodice.com/pt/articolo/6372376/double-exponential-problems-closed

algorithm - np-complete - np

Is it necessary for NP problems to be decision problems ?

https://www.generacodice.com/pt/articolo/6358240/is-it-necessary-for-np-problems-to-be-decision-problems

algorithm - np-complete - np

NP class : Why polynomial length outputs?

https://www.generacodice.com/pt/articolo/6357937/np-class-why-polynomial-length-outputs

algorithm - np-complete - np

Is it compulsory that the 'reduction of p‌r‌o‌b‌l‌e‌m be done in polynomial time' for it to be NP complete?

https://www.generacodice.com/pt/articolo/6350968/is-it-compulsory-that-the-reduction-of-p-r-o-b-l-e-m-be-done-in-polynomial-time-for-it-to-be-np-complete

algorithm - np-complete - np

can some sorting be P, NP, and NP-Complete?

https://www.generacodice.com/pt/articolo/5596403/can-some-sorting-be-p-np-and-np-complete

algorithm - sorting - np-complete - p-np - np

Which of these languages is NP-complete?

https://www.generacodice.com/pt/articolo/5588387/which-of-these-languages-is-np-complete

algorithm - theory - computer-science - np-complete - np

NP hard but not NPC

https://www.generacodice.com/pt/articolo/5449385/np-hard-but-not-npc

np-complete - scheduling - np-hard - np

Proving NP complexity

https://www.generacodice.com/pt/articolo/5430602/proving-np-complexity

algorithm - proof - np

When NP complete becomes NP hard

https://www.generacodice.com/pt/articolo/5394923/when-np-complete-becomes-np-hard

np-complete - np-hard - np

Expression from an array of numbers

https://www.generacodice.com/pt/articolo/5214488/expression-from-an-array-of-numbers

math - algorithm - data-structures - np-hard - np

«
3
4
5
6
7
8
»

Resultados encontrados: 620