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

Redução de VC a {a, k |A é um 3DNF (forma normal disjuntiva) e existe uma tarefa satisfazendo exatamente k cláusos em um}

https://www.generacodice.com/pt/articolo/2478310/reducao-de-vc-a-a-k-a-e-um-3dnf-forma-normal-disjuntiva-e-existe-uma-tarefa-satisfazendo-exatamente-k-clausos-em-um
  complexity-theory  -  np-complete  -  check-my-answer  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

$ \ Phi_1= 1 $ ou $ \ phi_1= 2 $ para o dinâmico $ \ texto {table-insert} $, onde $ \ phi_i $ é a função potencial após $ i $ th operação, como por clrs

https://www.generacodice.com/pt/articolo/2472163/-phi-1-1-ou-phi-1-2-para-o-dinamico-texto-table-insert-onde-phi-i-e-a-funcao-potencial-apos-i-th-operacao-como-por-clrs
  arrays  -  amortized-analysis  -  algorithm-analysis  -  runtime-analysis  -  check-my-answer
cs.stackexchange cs.stackexchange

Para seleção em pior caso a ambiguidade de tempo linear em consideração de $ n $ para qual $ t (n)= o (1) $ e $ t (n) \ leq cn $

https://www.generacodice.com/pt/articolo/2470511/para-selecao-em-pior-caso-a-ambiguidade-de-tempo-linear-em-consideracao-de-n-para-qual-t-n-o-1-e-t-n-leq-cn
  algorithms  -  algorithm-analysis  -  runtime-analysis  -  recurrence-relation  -  check-my-answer
cs.stackexchange cs.stackexchange

How to prove by contradiction that every nonempty hereditary language contains the empty string?

https://www.generacodice.com/pt/articolo/1616578/how-to-prove-by-contradiction-that-every-nonempty-hereditary-language-contains-the-empty-string
  proof-techniques  -  check-my-answer
cs.stackexchange cs.stackexchange

how to prove that log(n!) >= c n log(n) for some c >0?

https://www.generacodice.com/pt/articolo/1616192/how-to-prove-that-log-n-c-n-log-n-for-some-c-0
  algorithms  -  check-my-answer
cs.stackexchange cs.stackexchange

Number of possible heaps on $\{1,…,2^h-1\}$

https://www.generacodice.com/pt/articolo/1613356/number-of-possible-heaps-on-1-2-h-1
  enumeration  -  combinatorics  -  recurrence-relation  -  check-my-answer  -  heaps
cs.stackexchange cs.stackexchange

Minimal paths as solution of a linear program of a special network flow

https://www.generacodice.com/pt/articolo/1610790/minimal-paths-as-solution-of-a-linear-program-of-a-special-network-flow
  linear-programming  -  shortest-path  -  check-my-answer
cs.stackexchange cs.stackexchange

Why is this a proof by contradiction for this algorithm? Isn't this a direct proof instead?

https://www.generacodice.com/pt/articolo/1610207/why-is-this-a-proof-by-contradiction-for-this-algorithm-isn-t-this-a-direct-proof-instead
  algorithms  -  correctness-proof  -  check-my-answer
cs.stackexchange cs.stackexchange

Is this proof for showing that $EQ_{CFG}$ is co-Turing-recognizable incorrect?

https://www.generacodice.com/pt/articolo/1608836/is-this-proof-for-showing-that-eq-cfg-is-co-turing-recognizable-incorrect
  turing-machines  -  context-free  -  check-my-answer
cs.stackexchange cs.stackexchange

$ L = \{xyyz\in\{0,1,2\}^{*} : y \neq \epsilon \wedge \exists_{a \in \{0,1,2\}} |y|_a \equiv 0 \}$

https://www.generacodice.com/pt/articolo/1608326/-l-xyyz-in-0-1-2-y-neq-epsilon-wedge-exists-a-in-0-1-2-y-a-equiv-0
  regular-languages  -  regular-expressions  -  check-my-answer
cs.stackexchange cs.stackexchange
Resultados encontrados: 68
scroll top