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 decision-problem - This is page 4 - GeneraCodice
Is there a polynomial time algorithm for this decision problem?
https://www.generacodice.com/en/articolo/2466439/is-there-a-polynomial-time-algorithm-for-this-decision-problem
decision-problem
-
polynomial-time
cs.stackexchange
If a decision problem is in $P$, must finding the solution be possible in polynomial-time?
https://www.generacodice.com/en/articolo/2465533/if-a-decision-problem-is-in-p-must-finding-the-solution-be-possible-in-polynomial-time
decision-problem
cs.stackexchange
Longest palindrome substring in logarithmic runtime complexity
https://www.generacodice.com/en/articolo/2464910/longest-palindrome-substring-in-logarithmic-runtime-complexity
comparison
-
decision-tree
-
algorithms
-
algorithm-analysis
-
decision-problem
cs.stackexchange
Are NP proofs limited to polynomial length?
https://www.generacodice.com/en/articolo/2464495/are-np-proofs-limited-to-polynomial-length
complexity-theory
-
np
-
decision-problem
cs.stackexchange
Karp reduction from optimization problems to decision problems
https://www.generacodice.com/en/articolo/2463841/karp-reduction-from-optimization-problems-to-decision-problems
np-complete
-
np
-
reductions
-
decision-problem
-
polynomial-time-reductions
cs.stackexchange
How does the length of the output of a problem inform its complexity?
https://www.generacodice.com/en/articolo/2461098/how-does-the-length-of-the-output-of-a-problem-inform-its-complexity
optimization
-
complexity-theory
-
algorithms
-
decision-problem
cs.stackexchange
Algorithms that run in polynomial time if P=NP
https://www.generacodice.com/en/articolo/2458475/algorithms-that-run-in-polynomial-time-if-p-np
time-complexity
-
algorithms
-
decision-problem
-
p-vs-np
-
polynomial-time
cs.stackexchange
A special case of subset sum
https://www.generacodice.com/en/articolo/2445185/a-special-case-of-subset-sum
complexity-theory
-
algorithms
-
undecidability
-
decision-problem
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
Is the problem of deciding whether two programs have the same semantics decidable?
https://www.generacodice.com/en/articolo/2442581/is-the-problem-of-deciding-whether-two-programs-have-the-same-semantics-decidable
semantics
-
undecidability
-
decision-problem
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 400