Tag proof-techniques - Esta é a página 51 - GeneraCodice

How to prove NP-hardness of a longest-path problem?

https://www.generacodice.com/pt/articolo/1120076/how-to-prove-np-hardness-of-a-longest-path-problem
  complexity-theory  -  np-hard  -  proof-techniques  -  reductions
cs.stackexchange cs.stackexchange

Proving non-confluency and adding an equation to make it confluent and terminating

https://www.generacodice.com/pt/articolo/1118924/proving-non-confluency-and-adding-an-equation-to-make-it-confluent-and-terminating
  logic  -  semantics  -  proof-techniques  -  term-rewriting
cs.stackexchange cs.stackexchange

Proof-sketch on the language accepted by a Turing machine

https://www.generacodice.com/pt/articolo/1118819/proof-sketch-on-the-language-accepted-by-a-turing-machine
  turing-machines  -  formal-languages  -  proof-techniques
cs.stackexchange cs.stackexchange

How to apply the pumping lemma to $\{0^m 1^n \mid 2n \leq m \leq 3n, m,n \geq 0 \}$?

https://www.generacodice.com/pt/articolo/1118805/how-to-apply-the-pumping-lemma-to-0-m-1-n-mid-2n-leq-m-leq-3n-m-n-geq-0
  pumping-lemma  -  regular-languages  -  proof-techniques
cs.stackexchange cs.stackexchange

How do I explain that a polynomial time reduction is in fact polynomial time?

https://www.generacodice.com/pt/articolo/1118479/how-do-i-explain-that-a-polynomial-time-reduction-is-in-fact-polynomial-time
  complexity-theory  -  np-complete  -  proof-techniques  -  reductions
cs.stackexchange cs.stackexchange

Rigorous proof for validity of assumption $n=b^k$ when using the Master theorem

https://www.generacodice.com/pt/articolo/1118041/rigorous-proof-for-validity-of-assumption-n-b-k-when-using-the-master-theorem
  master-theorem  -  asymptotics  -  proof-techniques  -  recurrence-relation
cs.stackexchange cs.stackexchange

Convergence of Simulated Annealing Based Algorithms

https://www.generacodice.com/pt/articolo/1117503/convergence-of-simulated-annealing-based-algorithms
  optimization  -  algorithms  -  reference-request  -  proof-techniques
cs.stackexchange cs.stackexchange

Proof of the Stable Matching Problem

https://www.generacodice.com/pt/articolo/1117183/proof-of-the-stable-matching-problem
  matching  -  algorithms  -  proof-techniques
cs.stackexchange cs.stackexchange

Languages that satisfy the pumping lemma but aren't regular?

https://www.generacodice.com/pt/articolo/1117149/languages-that-satisfy-the-pumping-lemma-but-aren-t-regular
  formal-languages  -  proof-techniques
cs.stackexchange cs.stackexchange

The use of multiset ordering in proving termination

https://www.generacodice.com/pt/articolo/1116835/the-use-of-multiset-ordering-in-proving-termination
  algorithm-analysis  -  proof-techniques  -  correctness-proof  -  sets
cs.stackexchange cs.stackexchange
Resultados encontrados: 577
scroll top