日本の
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 - これはページ12です - GeneraCodice
Clique-or-almost reduction to clique
https://www.generacodice.com/jp/articolo/1808408/clique-or-almost-reduction-to-clique
np-hard
-
reductions
cs.stackexchange
Why log-space reduction is used for NL-completeness while PSPACE reduction isn't used for PSPACE completeness?
https://www.generacodice.com/jp/articolo/1620803/why-log-space-reduction-is-used-for-nl-completeness-while-pspace-reduction-isn-t-used-for-pspace-completeness
complexity-theory
-
time-complexity
-
space-complexity
-
reductions
-
complexity-classes
cs.stackexchange
Is Finding A Hitting Set of Size n/2 NP-Hard?
https://www.generacodice.com/jp/articolo/1620725/is-finding-a-hitting-set-of-size-n-2-np-hard
set-cover
-
reductions
cs.stackexchange
I want to know where there is the flaw in my argument
https://www.generacodice.com/jp/articolo/1620676/i-want-to-know-where-there-is-the-flaw-in-my-argument
turing-machines
-
halting-problem
-
undecidability
-
reductions
cs.stackexchange
Is finding a minimal set of seed variables for a complete deduction of a system of equations NP-complete?
https://www.generacodice.com/jp/articolo/1616357/is-finding-a-minimal-set-of-seed-variables-for-a-complete-deduction-of-a-system-of-equations-np-complete
np-complete
-
graphs
-
reductions
cs.stackexchange
Halting problem in EXP-complete
https://www.generacodice.com/jp/articolo/1616178/halting-problem-in-exp-complete
complexity-theory
-
reductions
cs.stackexchange
Differences between ALLTM and INF
https://www.generacodice.com/jp/articolo/1616088/differences-between-alltm-and-inf
complexity-theory
-
turing-machines
-
undecidability
-
reductions
cs.stackexchange
Is every Turing complete set for EXPSPACE autoreducible?
https://www.generacodice.com/jp/articolo/1615585/is-every-turing-complete-set-for-expspace-autoreducible
complexity-theory
-
reductions
cs.stackexchange
Why is $ZPP \geq BPP$ not true?
https://www.generacodice.com/jp/articolo/1615542/why-is-zpp-geq-bpp-not-true
complexity-theory
-
reductions
-
randomized-algorithms
cs.stackexchange
Normal colorings of cubic graphs to SAT
https://www.generacodice.com/jp/articolo/1614949/normal-colorings-of-cubic-graphs-to-sat
graphs
-
reductions
cs.stackexchange
«
9
10
11
12
13
14
»
結果が見つかりました: 998