Tag check-my-answer - This is page 1 - GeneraCodice

Reduction from VC to {a,k | a is a 3DNF (disjunctive normal form) and there exists an assignment satisfying exactly k clauses in a}

https://www.generacodice.com/en/articolo/2478310/reduction-from-vc-to-a-k-a-is-a-3dnf-disjunctive-normal-form-and-there-exists-an-assignment-satisfying-exactly-k-clauses-in-a
  complexity-theory  -  np-complete  -  check-my-answer  -  polynomial-time-reductions
cs.stackexchange cs.stackexchange

$\Phi_1=1$ or $\Phi_1=2$ for the dynamic $\text{Table-Insert}$ , where $\Phi_i$ is the potential function after $i$ th operation, as per CLRS

https://www.generacodice.com/en/articolo/2472163/-phi-1-1-or-phi-1-2-for-the-dynamic-text-table-insert-where-phi-i-is-the-potential-function-after-i-th-operation-as-per-clrs
  arrays  -  amortized-analysis  -  algorithm-analysis  -  runtime-analysis  -  check-my-answer
cs.stackexchange cs.stackexchange

For selection in worst-case linear time ambiguity in consideration of $n$ for which $T(n) =O(1)$ and $T(n)\leq cn$

https://www.generacodice.com/en/articolo/2470511/for-selection-in-worst-case-linear-time-ambiguity-in-consideration-of-n-for-which-t-n-o-1-and-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/en/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/en/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/en/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/en/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/en/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/en/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/en/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
Results found: 68
scroll top