We constructively prove the existence of almost complete problems under logspace manyone reduction for some small complexity classes by exhibiting a parametrizable construction which yields, when appropriately setting the parameters, an almost complete problem for PSPACE, the class of space efficiently decidable problems, and for SUBEXP, the class of problems ... more >>>
Let \mathcal{F} be a finite alphabet and \mathcal{D} be a finite set of distributions over \mathcal{F}. A Generalized Santha-Vazirani (GSV) source of type (\mathcal{F}, \mathcal{D}), introduced by Beigi, Etesami and Gohari (ICALP 2015, SICOMP 2017), is a random sequence (F_1, \dots, F_n) in \mathcal{F}^n, where F_i is a sample from ... more >>>
We give a complete answer to the following basic question: ``What is the maximal fraction of deletions or insertions tolerable by q-ary list-decodable codes with non-vanishing information rate?''
This question has been open even for binary codes, including the restriction to the binary insertion-only setting, where the best known results ... more >>>