Tag check-my-proof - Esta é a página 1 - GeneraCodice

Proving that a language is not in P using diagonalization

https://www.generacodice.com/pt/articolo/1124806/proving-that-a-language-is-not-in-p-using-diagonalization
  complexity-theory  -  check-my-proof  -  polynomial-time
cs.stackexchange cs.stackexchange

Quasigroups, congruences and recognizable subsets

https://www.generacodice.com/pt/articolo/1123877/quasigroups-congruences-and-recognizable-subsets
  formal-languages  -  reference-request  -  check-my-proof
cs.stackexchange cs.stackexchange

How can I show a linear languages are closed against concatenating with regular ones?

https://www.generacodice.com/pt/articolo/1120484/how-can-i-show-a-linear-languages-are-closed-against-concatenating-with-regular-ones
  formal-languages  -  context-free  -  closure-properties  -  check-my-proof
cs.stackexchange cs.stackexchange

Lower bound for sorting n arrays of size k each

https://www.generacodice.com/pt/articolo/1120333/lower-bound-for-sorting-n-arrays-of-size-k-each
  arrays  -  sorting  -  algorithms  -  lower-bounds  -  check-my-proof
cs.stackexchange cs.stackexchange

Number of Hamiltonian cycles on a Sierpiński graph

https://www.generacodice.com/pt/articolo/1119290/number-of-hamiltonian-cycles-on-a-sierpinski-graph
  graph-theory  -  combinatorics  -  check-my-proof
cs.stackexchange cs.stackexchange

Show $x^y$ is a primitive recursive function

https://www.generacodice.com/pt/articolo/1116648/show-x-y-is-a-primitive-recursive-function
  recursion  -  computability  -  check-my-proof
cs.stackexchange cs.stackexchange

Error in Generating Function Solution

https://www.generacodice.com/pt/articolo/1098851/error-in-generating-function-solution
  recurrence-relation  -  mathematical-analysis  -  check-my-proof
cs.stackexchange cs.stackexchange

Is Karp Reduction identical to Levin Reduction

https://www.generacodice.com/pt/articolo/1097529/is-karp-reduction-identical-to-levin-reduction
  complexity-theory  -  reductions  -  check-my-proof
cs.stackexchange cs.stackexchange

Show that the halting problem is decidable for one-pass Turing machines

https://www.generacodice.com/pt/articolo/1096692/show-that-the-halting-problem-is-decidable-for-one-pass-turing-machines
  turing-machines  -  computability  -  formal-languages  -  check-my-proof
cs.stackexchange cs.stackexchange
Resultados encontrados: 19
scroll top