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 38 - GeneraCodice
NP complete problems that are solvable in polynomial time if the input (e.g. number of variables) is fixed?
https://www.generacodice.com/en/articolo/1122299/np-complete-problems-that-are-solvable-in-polynomial-time-if-the-input-e-g-number-of-variables-is-fixed
optimization
-
np-complete
-
linear-programming
-
decision-problem
-
parameterized-complexity
cs.stackexchange
Is the 0-1 Knapsack problem where value equals weight NP-complete?
https://www.generacodice.com/en/articolo/1121058/is-the-0-1-knapsack-problem-where-value-equals-weight-np-complete
complexity-theory
-
np-complete
-
packing
-
decision-problem
cs.stackexchange
Do any decision problems exist outside NP and NP-Hard?
https://www.generacodice.com/en/articolo/1120520/do-any-decision-problems-exist-outside-np-and-np-hard
complexity-theory
-
np-complete
-
np-hard
-
decision-problem
-
complexity-classes
cs.stackexchange
Is every regular language Turing-decidable, and how can we prove this?
https://www.generacodice.com/en/articolo/1120451/is-every-regular-language-turing-decidable-and-how-can-we-prove-this
terminology
-
computability
-
regular-languages
-
decision-problem
cs.stackexchange
Is there an efficient test for if an NFA accepts a subset of another NFA?
https://www.generacodice.com/en/articolo/1118700/is-there-an-efficient-test-for-if-an-nfa-accepts-a-subset-of-another-nfa
np-complete
-
automata
-
algorithms
-
regular-languages
-
decision-problem
cs.stackexchange
Is matching with mismatches a special(parametrized) case of Closest String problem?
https://www.generacodice.com/en/articolo/1117741/is-matching-with-mismatches-a-special-parametrized-case-of-closest-string-problem
np-complete
-
matching
-
decision-problem
cs.stackexchange
What is the decision version of independent set?
https://www.generacodice.com/en/articolo/1117551/what-is-the-decision-version-of-independent-set
complexity-theory
-
terminology
-
decision-problem
cs.stackexchange
Is it possible to decide if a given algorithm is asymptotically optimal?
https://www.generacodice.com/en/articolo/1117518/is-it-possible-to-decide-if-a-given-algorithm-is-asymptotically-optimal
complexity-theory
-
computability
-
undecidability
-
decision-problem
cs.stackexchange
Complexity of a subset sum variant
https://www.generacodice.com/en/articolo/1116703/complexity-of-a-subset-sum-variant
complexity-theory
-
reference-request
-
decision-problem
cs.stackexchange
Decision problem and algorithm
https://www.generacodice.com/en/articolo/1112152/decision-problem-and-algorithm
turing-machines
-
computability
-
undecidability
-
decision-problem
cs.stackexchange
«
35
36
37
38
39
40
»
Results found: 400