日本の
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
完全な記事
カテゴリ
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
あなたが書く
ユーザー
ログイン
登録
パスワードの復元
タグ
言語タグ
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
タグdecision-problem - これはページ7です - GeneraCodice
Complement of languages and coNP
https://www.generacodice.com/jp/articolo/1616053/complement-of-languages-and-conp
complexity-theory
-
formal-languages
-
decision-problem
-
co-np
cs.stackexchange
is FIND WORDS in P?
https://www.generacodice.com/jp/articolo/1615834/is-find-words-in-p
np
-
decision-problem
cs.stackexchange
Verifying Hamiltonian Cycle solution in O(n^2), n is the length of the encoding of G
https://www.generacodice.com/jp/articolo/1615422/verifying-hamiltonian-cycle-solution-in-o-n-2-n-is-the-length-of-the-encoding-of-g
np-complete
-
np-hard
-
np
-
decision-problem
-
hamiltonian-circuit
cs.stackexchange
Show that there are infinitely more problems than we will ever be able to compute
https://www.generacodice.com/jp/articolo/1615102/show-that-there-are-infinitely-more-problems-than-we-will-ever-be-able-to-compute
computability
-
proof-techniques
-
decision-problem
-
uncountability
cs.stackexchange
Subset with modified condition, is it still NP-complete? [closed]
https://www.generacodice.com/jp/articolo/1613015/subset-with-modified-condition-is-it-still-np-complete-closed
np-complete
-
np-hard
-
decision-problem
cs.stackexchange
NP hardness of unique Puzzle Generation
https://www.generacodice.com/jp/articolo/1612596/np-hardness-of-unique-puzzle-generation
np-complete
-
np
-
decision-problem
cs.stackexchange
3-DNF proves the algorithm is in P class
https://www.generacodice.com/jp/articolo/1612319/3-dnf-proves-the-algorithm-is-in-p-class
satisfiability
-
decision-problem
cs.stackexchange
Proving $L = \{\langle M, w, n \rangle$ : $M$ accepts $w$ within $n$ steps $\}$ is decidable
https://www.generacodice.com/jp/articolo/1611227/proving-l-langle-m-w-n-rangle-m-accepts-w-within-n-steps-is-decidable
turing-machines
-
computability
-
decision-problem
cs.stackexchange
A tricky P=NP problem
https://www.generacodice.com/jp/articolo/1610889/a-tricky-p-np-problem
complexity-theory
-
np
-
decision-problem
-
p-vs-np
cs.stackexchange
Fine-grained complexity of 3-CNF formula evaluation
https://www.generacodice.com/jp/articolo/1609047/fine-grained-complexity-of-3-cnf-formula-evaluation
satisfiability
-
time-complexity
-
sat-solvers
-
3-sat
-
decision-problem
cs.stackexchange
«
4
5
6
7
8
9
»
結果が見つかりました: 400