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

First Page		Document Content
Date: 2018-02-06 15:06:57		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 Source URL: proceedings.mlr.press Download Document from Source Website File Size: 234,98 KB Share Document on Facebook