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

Np-hardness reduction

https://www.generacodice.com/pt/articolo/3437803/np-hardness-reduction

algorithm - np-complete - np-hard - np

Np-hardness reduction

https://www.generacodice.com/pt/articolo/3437789/np-hardness-reduction

algorithm - np-complete - np-hard - np

Np-hardness reduction

https://www.generacodice.com/pt/articolo/3437567/np-hardness-reduction

algorithm - np-complete - np-hard - np

Np-hardness reduction

https://www.generacodice.com/pt/articolo/3437177/np-hardness-reduction

algorithm - np-complete - np-hard - np

Maximum Independent Set Algorithm

https://www.generacodice.com/pt/articolo/3276988/maximum-independent-set-algorithm

algorithm - graph-theory - max - np - independent-set

How is 2-CNF SAT is in P, while 3-CNF SAT is in NPC?

https://www.generacodice.com/pt/articolo/3231248/how-is-2-cnf-sat-is-in-p-while-3-cnf-sat-is-in-npc

algorithm - np-complete - np

Is it a sufficient condition to be in NP?

https://www.generacodice.com/pt/articolo/2480117/is-it-a-sufficient-condition-to-be-in-np

complexity-theory - np - complexity-classes

cs.stackexchange

Can quantum computing help solve NP-Complete problems?

https://www.generacodice.com/pt/articolo/2479785/can-quantum-computing-help-solve-np-complete-problems

np-complete - quantum-computing - np

cs.stackexchange

algoritmo para verificar satisfiability

https://www.generacodice.com/pt/articolo/2476884/algoritmo-para-verificar-satisfiability

complexity-theory - computability - satisfiability - np - 3-sat

cs.stackexchange

Que eu possa verificar soluções para o meu problema em tempo polinomial, como um não-determinístico algoritmo de chegar a uma solução, se ela sempre leva us $2^n$ bits?

https://www.generacodice.com/pt/articolo/2472926/que-eu-possa-verificar-solucoes-para-o-meu-problema-em-tempo-polinomial-como-um-nao-deterministico-algoritmo-de-chegar-a-uma-solucao-se-ela-sempre-leva-us-2-n-bits

complexity-theory - np

cs.stackexchange

«
5
6
7
8
9
10
»

Resultados encontrados: 620