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 35 - GeneraCodice
Detecting a subsequence that's an arithmetic progression, in a sorted sequence
https://www.generacodice.com/en/articolo/1489984/detecting-a-subsequence-that-s-an-arithmetic-progression-in-a-sorted-sequence
algorithms
-
decision-problem
-
subsequences
cs.stackexchange
“Unusual” coupling between a decision problem and a corresponding optimization problem
https://www.generacodice.com/en/articolo/1489496/unusual-coupling-between-a-decision-problem-and-a-corresponding-optimization-problem
optimization
-
complexity-theory
-
reference-request
-
decision-problem
cs.stackexchange
Complexity of (SAT to 3-SAT) Problem?
https://www.generacodice.com/en/articolo/1467968/complexity-of-sat-to-3-sat-problem
complexity-theory
-
satisfiability
-
decision-problem
-
complexity-classes
cs.stackexchange
3-SAT where variables occur equally many times as a positive literal and as a negative literal
https://www.generacodice.com/en/articolo/1467821/3-sat-where-variables-occur-equally-many-times-as-a-positive-literal-and-as-a-negative-literal
complexity-theory
-
np-complete
-
satisfiability
-
decision-problem
cs.stackexchange
Complexity of deciding the satisfiability of a quasi-monotone CNF formula
https://www.generacodice.com/en/articolo/1467182/complexity-of-deciding-the-satisfiability-of-a-quasi-monotone-cnf-formula
complexity-theory
-
np-complete
-
satisfiability
-
decision-problem
cs.stackexchange
Undecidability of the PCP problem with bounded width
https://www.generacodice.com/en/articolo/1466740/undecidability-of-the-pcp-problem-with-bounded-width
computability
-
undecidability
-
reference-request
-
decision-problem
cs.stackexchange
One $O(n^k)$ algorithm requiring only one $O(2^n)$ computation (for all n instances) is P or NP
https://www.generacodice.com/en/articolo/1128159/one-o-n-k-algorithm-requiring-only-one-o-2-n-computation-for-all-n-instances-is-p-or-np
complexity-theory
-
np
-
decision-problem
cs.stackexchange
Show a TM-recognizable language of TMs can be expressed by TM-description language of equivalent TMs
https://www.generacodice.com/en/articolo/1127871/show-a-tm-recognizable-language-of-tms-can-be-expressed-by-tm-description-language-of-equivalent-tms
turing-machines
-
computability
-
decision-problem
cs.stackexchange
Can a method be written if the language is undecidable?
https://www.generacodice.com/en/articolo/1127493/can-a-method-be-written-if-the-language-is-undecidable
halting-problem
-
formal-grammars
-
undecidability
-
turing-completeness
-
decision-problem
cs.stackexchange
Computer science problems related to music?
https://www.generacodice.com/en/articolo/1125274/computer-science-problems-related-to-music
probability-theory
-
probabilistic-algorithms
-
decision-problem
cs.stackexchange
«
32
33
34
35
36
37
»
Results found: 400