日本の
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
タグreductions - これはページ9です - GeneraCodice
Is the Clique Problem polynomial time reducible to the graph-Homomorphism Problem and if so what does the reduction look like?
https://www.generacodice.com/jp/articolo/2447894/is-the-clique-problem-polynomial-time-reducible-to-the-graph-homomorphism-problem-and-if-so-what-does-the-reduction-look-like
complexity-theory
-
np-complete
-
graphs
-
reductions
cs.stackexchange
多項式多項対1回の減少は特定の問題例に行うことができますか?
https://www.generacodice.com/jp/articolo/2444506/多項式多項対1回の減少は特定の問題例に行うことができますか
complexity-theory
-
reductions
cs.stackexchange
整数線形プログラムのNP完全性
https://www.generacodice.com/jp/articolo/2444160/整数線形プログラムのnp完全性
np-complete
-
reductions
-
decision-problem
cs.stackexchange
ドロイドトレーダーの問題はNP-Completeであることを証明しています
https://www.generacodice.com/jp/articolo/2443926/ドロイドトレーダーの問題はnp-completeであることを証明しています
complexity-theory
-
np-complete
-
reductions
cs.stackexchange
ハミルトニアンサイクル、検証と発見
https://www.generacodice.com/jp/articolo/2442702/ハミルトニアンサイクル-検証と発見
complexity-theory
-
reductions
-
hamiltonian-path
cs.stackexchange
頂点カバーから支配的なセットへの削減
https://www.generacodice.com/jp/articolo/2441622/頂点カバーから支配的なセットへの削減
np-hard
-
correctness-proof
-
reductions
-
polynomial-time-reductions
cs.stackexchange
Example of two undecidable languages that cannot be reduced to each other
https://www.generacodice.com/jp/articolo/1811059/example-of-two-undecidable-languages-that-cannot-be-reduced-to-each-other
turing-machines
-
automata
-
formal-languages
-
reductions
cs.stackexchange
How do we construct reductions for NP-Completeness
https://www.generacodice.com/jp/articolo/1810826/how-do-we-construct-reductions-for-np-completeness
np-complete
-
reductions
cs.stackexchange
Is finding the minimum feedback arc set on graph with two outgoing arcs for each node np-complete?
https://www.generacodice.com/jp/articolo/1810460/is-finding-the-minimum-feedback-arc-set-on-graph-with-two-outgoing-arcs-for-each-node-np-complete
complexity-theory
-
np-complete
-
reductions
cs.stackexchange
Reductions from non decision problems
https://www.generacodice.com/jp/articolo/1810070/reductions-from-non-decision-problems
complexity-theory
-
np-complete
-
computability
-
approximation
-
reductions
cs.stackexchange
«
6
7
8
9
10
11
»
結果が見つかりました: 998