Tag decision-problem - This is page 8 - GeneraCodice

NP hardness of unique Puzzle Generation

https://www.generacodice.com/en/articolo/1612596/np-hardness-of-unique-puzzle-generation
  np-complete  -  np  -  decision-problem
cs.stackexchange cs.stackexchange

3-DNF proves the algorithm is in P class

https://www.generacodice.com/en/articolo/1612319/3-dnf-proves-the-algorithm-is-in-p-class
  satisfiability  -  decision-problem
cs.stackexchange cs.stackexchange

Proving $L = \{\langle M, w, n \rangle$ : $M$ accepts $w$ within $n$ steps $\}$ is decidable

https://www.generacodice.com/en/articolo/1611227/proving-l-langle-m-w-n-rangle-m-accepts-w-within-n-steps-is-decidable
  turing-machines  -  computability  -  decision-problem
cs.stackexchange cs.stackexchange

A tricky P=NP problem

https://www.generacodice.com/en/articolo/1610889/a-tricky-p-np-problem
  complexity-theory  -  np  -  decision-problem  -  p-vs-np
cs.stackexchange cs.stackexchange

Fine-grained complexity of 3-CNF formula evaluation

https://www.generacodice.com/en/articolo/1609047/fine-grained-complexity-of-3-cnf-formula-evaluation
  satisfiability  -  time-complexity  -  sat-solvers  -  3-sat  -  decision-problem
cs.stackexchange cs.stackexchange

Is the set of language decidable by some Turing machine computing in some given computable time bound decidable

https://www.generacodice.com/en/articolo/1609034/is-the-set-of-language-decidable-by-some-turing-machine-computing-in-some-given-computable-time-bound-decidable
  turing-machines  -  computability  -  undecidability  -  decision-problem
cs.stackexchange cs.stackexchange

Reducing 3SAT to a Set Splitting Problem

https://www.generacodice.com/en/articolo/1608988/reducing-3sat-to-a-set-splitting-problem
  np-complete  -  np-hard  -  np  -  decision-problem
cs.stackexchange cs.stackexchange

Show: “Checking no solution for system of linear equations with integer variables and coefficients” $\in \mathbf{NP}$

https://www.generacodice.com/en/articolo/1608976/show-checking-no-solution-for-system-of-linear-equations-with-integer-variables-and-coefficients-in-mathbf-np
  turing-machines  -  np  -  decision-problem  -  complexity-classes
cs.stackexchange cs.stackexchange

What's after EXPSPACE?

https://www.generacodice.com/en/articolo/1608936/what-s-after-expspace
  complexity-theory  -  computability  -  space-complexity  -  decision-problem
cs.stackexchange cs.stackexchange

Interesting logic problems

https://www.generacodice.com/en/articolo/1608772/interesting-logic-problems
  logic  -  search-problem  -  decision-problem
cs.stackexchange cs.stackexchange
Results found: 400
scroll top