Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms A. Hardness of V ITERBI PATH with small alphabet: Proof Throughout the proof, we set p = d Cε e and α = C - Clique - Document - PDFSEARCH.IO

First Page	Meta Content
	Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms A. Hardness of V ITERBI PATH with small alphabet: Proof Throughout the proof, we set p = d Cε e and α = C Add to Reading List Document Date: 2018-02-06 15:06:57 Open Document File Size: 234,98 KB Share Result on Facebook

Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms A. Hardness of V ITERBI PATH with small alphabet: Proof Throughout the proof, we set p = d Cε e and α = CAdd to Reading List