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 8 - GeneraCodice
IS there a consensus on the definition of a computer program in CS literature and if so, what is it?
https://www.generacodice.com/en/articolo/2452522/is-there-a-consensus-on-the-definition-of-a-computer-program-in-cs-literature-and-if-so-what-is-it
terminology
-
reductions
cs.stackexchange
Two versions of Subset Sum Problem
https://www.generacodice.com/en/articolo/2452373/two-versions-of-subset-sum-problem
complexity-theory
-
np-complete
-
subset-sum
-
reductions
cs.stackexchange
Reduce $L_c=\{\langle M_1 \rangle, \langle M_2 \rangle):L(M_1)\cap L(M_2)\neq \emptyset\}$ to $A_{TM} $
https://www.generacodice.com/en/articolo/2450771/reduce-l-c-langle-m-1-rangle-langle-m-2-rangle-l-m-1-cap-l-m-2-neq-emptyset-to-a-tm
complexity-theory
-
turing-machines
-
computability
-
reductions
cs.stackexchange
why does $ A≤_p \#SAT$ if $A \in BPP$
https://www.generacodice.com/en/articolo/2450565/why-does-a-p-sat-if-a-in-bpp
complexity-theory
-
turing-machines
-
computability
-
reductions
-
probabilistic-turing-machines
cs.stackexchange
Is the number of NP-complete problems finite?
https://www.generacodice.com/en/articolo/2449966/is-the-number-of-np-complete-problems-finite
complexity-theory
-
np-complete
-
np-hard
-
reductions
cs.stackexchange
if there is no reduction from A to B
https://www.generacodice.com/en/articolo/2448353/if-there-is-no-reduction-from-a-to-b
computability
-
reductions
cs.stackexchange
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/en/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
Can polynomial many-to-one reduction be done to a specific problem instance?
https://www.generacodice.com/en/articolo/2444506/can-polynomial-many-to-one-reduction-be-done-to-a-specific-problem-instance
complexity-theory
-
reductions
cs.stackexchange
NP-completeness for integer linear program
https://www.generacodice.com/en/articolo/2444160/np-completeness-for-integer-linear-program
np-complete
-
reductions
-
decision-problem
cs.stackexchange
Prove the Droid Trader Problem is NP-complete
https://www.generacodice.com/en/articolo/2443926/prove-the-droid-trader-problem-is-np-complete
complexity-theory
-
np-complete
-
reductions
cs.stackexchange
«
5
6
7
8
9
10
»
Results found: 998