88 citations · 311 across the 59 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2017★ 1 cited
A Converse to Banach's Fixed Point Theorem and its CLS Completeness
Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis
Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, t…
cs.CC2016★ 7 cited
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms
Arturs Backurs, Christos Tzamos
The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model (HMM) that results in a given sequence of observations. It runs in time given a se…