Português
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Artigos completos
Categorias
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
Você escreve
Do utilizador
Conecte-se
Cadastro
Recuperação de senha
Tag
Tags de idioma
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag np - Esta é a página 56 - GeneraCodice
$NP\subseteq TIME[O(n^{\log n})]$
https://www.generacodice.com/pt/articolo/1496096/np-subseteq-time-o-n-log-n
complexity-theory
-
time-complexity
-
np
-
complexity-classes
cs.stackexchange
NP Problem definition – verifiable on DFA vs. solvable on NFA
https://www.generacodice.com/pt/articolo/1495831/np-problem-definition-verifiable-on-dfa-vs-solvable-on-nfa
complexity-theory
-
np
cs.stackexchange
Why is SAT in NP?
https://www.generacodice.com/pt/articolo/1495357/why-is-sat-in-np
complexity-theory
-
satisfiability
-
np
-
decision-problem
cs.stackexchange
Does a polynomial-time reduction from A to B imply that B is in NP if A is?
https://www.generacodice.com/pt/articolo/1494703/does-a-polynomial-time-reduction-from-a-to-b-imply-that-b-is-in-np-if-a-is
complexity-theory
-
np
-
reductions
cs.stackexchange
Proving that Max Weighted Independent Set is in NP
https://www.generacodice.com/pt/articolo/1494580/proving-that-max-weighted-independent-set-is-in-np
np
-
reductions
cs.stackexchange
Why doesn't a time cutoff convert NP problems into co-NP? [duplicate]
https://www.generacodice.com/pt/articolo/1494523/why-doesn-t-a-time-cutoff-convert-np-problems-into-co-np-duplicate
complexity-theory
-
np
-
co-np
cs.stackexchange
Is this path finding problem in a 01-matrix NP-complete?
https://www.generacodice.com/pt/articolo/1494091/is-this-path-finding-problem-in-a-01-matrix-np-complete
complexity-theory
-
np-complete
-
np
-
reductions
cs.stackexchange
Has it been proven that the optimization TSP is (or is not) polynomial-time verifiable if P ≠ NP?
https://www.generacodice.com/pt/articolo/1491068/has-it-been-proven-that-the-optimization-tsp-is-or-is-not-polynomial-time-verifiable-if-p-np
optimization
-
complexity-theory
-
traveling-salesman
-
np
cs.stackexchange
Existence of NP problems with complexity intermediate between P and NP-hard
https://www.generacodice.com/pt/articolo/1490362/existence-of-np-problems-with-complexity-intermediate-between-p-and-np-hard
complexity-theory
-
np
-
reference-request
-
p-vs-np
cs.stackexchange
Help reducing 3-SAT to 3-COLORING
https://www.generacodice.com/pt/articolo/1490098/help-reducing-3-sat-to-3-coloring
complexity-theory
-
np-complete
-
np
-
reductions
cs.stackexchange
«
53
54
55
56
57
58
»
Resultados encontrados: 620