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 93 - GeneraCodice
How do I explain that a polynomial time reduction is in fact polynomial time?
https://www.generacodice.com/en/articolo/1118479/how-do-i-explain-that-a-polynomial-time-reduction-is-in-fact-polynomial-time
complexity-theory
-
np-complete
-
proof-techniques
-
reductions
cs.stackexchange
Polynomial time reductions
https://www.generacodice.com/en/articolo/1118404/polynomial-time-reductions
complexity-theory
-
np-complete
-
terminology
-
reductions
cs.stackexchange
Definition of Strongly Parsimonious Reduction
https://www.generacodice.com/en/articolo/1118383/definition-of-strongly-parsimonious-reduction
complexity-theory
-
reductions
cs.stackexchange
HamCycle to HamPath reduction
https://www.generacodice.com/en/articolo/1118254/hamcycle-to-hampath-reduction
complexity-theory
-
np-complete
-
reductions
cs.stackexchange
Problems that are Cook-reducible to a problem in NP $\cap$ co-NP
https://www.generacodice.com/en/articolo/1118079/problems-that-are-cook-reducible-to-a-problem-in-np-cap-co-np
complexity-theory
-
np
-
reductions
cs.stackexchange
Does reduction from an NP-complete problem to some problem $X$ imply that $X\in NP$?
https://www.generacodice.com/en/articolo/1117847/does-reduction-from-an-np-complete-problem-to-some-problem-x-imply-that-x-in-np
complexity-theory
-
terminology
-
np
-
reductions
cs.stackexchange
Building functionally complete boolean circuits out of trinary logic
https://www.generacodice.com/en/articolo/1117217/building-functionally-complete-boolean-circuits-out-of-trinary-logic
logic
-
reference-request
-
circuits
-
reductions
cs.stackexchange
Is the “subset product” problem NP-complete?
https://www.generacodice.com/en/articolo/1112415/is-the-subset-product-problem-np-complete
complexity-theory
-
np-complete
-
reductions
cs.stackexchange
Is there a simple example of sets such that $A \leq_T B$ but not $A \leq_m B$?
https://www.generacodice.com/en/articolo/1112196/is-there-a-simple-example-of-sets-such-that-a-leq-t-b-but-not-a-leq-m-b
turing-machines
-
reductions
cs.stackexchange
Implications of polynomial time reductions
https://www.generacodice.com/en/articolo/1111330/implications-of-polynomial-time-reductions
complexity-theory
-
reductions
-
p-vs-np
-
complexity-classes
cs.stackexchange
«
90
91
92
93
94
95
»
Results found: 998