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 2 - GeneraCodice
I have a decision problem with $2^n$ bit sized certificates, how would I verify my decision problem efficiently if it is in $NP$?
https://www.generacodice.com/en/articolo/2472800/i-have-a-decision-problem-with-2-n-bit-sized-certificates-how-would-i-verify-my-decision-problem-efficiently-if-it-is-in-np
decision-problem
cs.stackexchange
Nondeterministic polynomial time algorithm versus certificate/verifier for showing membership in NP
https://www.generacodice.com/en/articolo/2472768/nondeterministic-polynomial-time-algorithm-versus-certificate-verifier-for-showing-membership-in-np
definitions
-
np
-
proof-techniques
-
decision-problem
-
complexity-classes
cs.stackexchange
Every decidable language $L$ has an infinite decidable subset $S \subset L$ such that $L \setminus S$ is infinite
https://www.generacodice.com/en/articolo/2471648/every-decidable-language-l-has-an-infinite-decidable-subset-s-subset-l-such-that-l-setminus-s-is-infinite
turing-machines
-
computation-models
-
decision-problem
cs.stackexchange
Proof of Co-Problem being in NP if Problem is in NP using negated output
https://www.generacodice.com/en/articolo/2471546/proof-of-co-problem-being-in-np-if-problem-is-in-np-using-negated-output
np-complete
-
np
-
decision-problem
cs.stackexchange
Computing automaton for $L(A) / L(B)$ gives ones for $A,B$
https://www.generacodice.com/en/articolo/2471312/computing-automaton-for-l-a-l-b-gives-ones-for-a-b
turing-machines
-
finite-automata
-
decision-problem
cs.stackexchange
Pick elements that don't exhaust any set
https://www.generacodice.com/en/articolo/2470938/pick-elements-that-don-t-exhaust-any-set
np-complete
-
decision-problem
cs.stackexchange
Why minimum vertex cover problem is in NP
https://www.generacodice.com/en/articolo/2470550/why-minimum-vertex-cover-problem-is-in-np
complexity-theory
-
np-complete
-
time-complexity
-
graphs
-
decision-problem
cs.stackexchange
checking whether turing machine passes at least k>2 states before accepting a word
https://www.generacodice.com/en/articolo/2470413/checking-whether-turing-machine-passes-at-least-k-2-states-before-accepting-a-word
turing-machines
-
decision-problem
cs.stackexchange
Variant of Subset-sum has an $O(1)$ algorithm if $Goldbach$ is true
https://www.generacodice.com/en/articolo/2470354/variant-of-subset-sum-has-an-o-1-algorithm-if-goldbach-is-true
reductions
-
decision-problem
cs.stackexchange
Complexity of Integer Factorization
https://www.generacodice.com/en/articolo/2469939/complexity-of-integer-factorization
complexity-theory
-
turing-machines
-
time-complexity
-
decision-problem
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 400