日本の
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 - これはページ6です - GeneraCodice
2つのプログラムが同じ意味を決定できるかどうかを判断するという問題ですか?
https://www.generacodice.com/jp/articolo/2442581/2つのプログラムが同じ意味を決定できるかどうかを判断するという問題ですか
semantics
-
undecidability
-
decision-problem
cs.stackexchange
TM decidable or undecidable problem
https://www.generacodice.com/jp/articolo/2442421/tm-decidable-or-undecidable-problem
turing-machines
-
undecidability
-
decision-problem
cs.stackexchange
Are there any proofs of exponential lower bound time complexity
https://www.generacodice.com/jp/articolo/1810500/are-there-any-proofs-of-exponential-lower-bound-time-complexity
complexity-theory
-
time-complexity
-
decision-problem
cs.stackexchange
Decide whether an $n$-bit positive integer is composite
https://www.generacodice.com/jp/articolo/1809888/decide-whether-an-n-bit-positive-integer-is-composite
complexity-theory
-
np-complete
-
np
-
decision-problem
cs.stackexchange
Decidability of decision problems
https://www.generacodice.com/jp/articolo/1616752/decidability-of-decision-problems
turing-machines
-
undecidability
-
semi-decidability
-
decision-problem
-
rice-theorem
cs.stackexchange
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
«
3
4
5
6
7
8
»
結果が見つかりました: 400