en
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Full articles
Categories
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
You write
User
Login
Registration
Password recovery
Tags
Language tags
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag reductions - This is page 1 - GeneraCodice
NP-completeness of a Generalized Version of Subset Sum
https://www.generacodice.com/en/articolo/2476998/np-completeness-of-a-generalized-version-of-subset-sum
np-complete
-
reductions
cs.stackexchange
Complexity of specific cases of MAX2SAT
https://www.generacodice.com/en/articolo/2475077/complexity-of-specific-cases-of-max2sat
complexity-theory
-
np-complete
-
satisfiability
-
reductions
-
2-sat
cs.stackexchange
What undecidable language $B$ is reducible to its complement?
https://www.generacodice.com/en/articolo/2472961/what-undecidable-language-b-is-reducible-to-its-complement
turing-machines
-
undecidability
-
reductions
cs.stackexchange
Show that for every language there exists a harder language
https://www.generacodice.com/en/articolo/2470979/show-that-for-every-language-there-exists-a-harder-language
turing-machines
-
undecidability
-
semi-decidability
-
reductions
cs.stackexchange
Variant of Subset-sum has an $O(1)$ algorithm if $Goldbach$ is true
https://www.generacodice.com/en/articolo/2470354/variant-of-subset-sum-has-an-o-1-algorithm-if-goldbach-is-true
reductions
-
decision-problem
cs.stackexchange
What does “If P1 is reduced to P2, then P2 is at least as hard as P1” mean?
https://www.generacodice.com/en/articolo/2470077/what-does-if-p1-is-reduced-to-p2-then-p2-is-at-least-as-hard-as-p1-mean
complexity-theory
-
reductions
cs.stackexchange
mapping reductions from R to RE
https://www.generacodice.com/en/articolo/2469992/mapping-reductions-from-r-to-re
turing-machines
-
reductions
cs.stackexchange
proving existence of TM that accepts the next language
https://www.generacodice.com/en/articolo/2469931/proving-existence-of-tm-that-accepts-the-next-language
turing-machines
-
reductions
cs.stackexchange
size of intersection of 2 languages size is not decidable
https://www.generacodice.com/en/articolo/2469473/size-of-intersection-of-2-languages-size-is-not-decidable
turing-machines
-
reductions
cs.stackexchange
How to prove NP-Completeness of longest path between two vertices relying Hamilton NP-Hard problem
https://www.generacodice.com/en/articolo/2468300/how-to-prove-np-completeness-of-longest-path-between-two-vertices-relying-hamilton-np-hard-problem
complexity-theory
-
np-complete
-
np-hard
-
reductions
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 998