research
∙
04/22/2023
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits
Polynomial Identity Testing (PIT) is a fundamental computational problem...
share
research
∙
11/14/2022
Border complexity via elementary symmetric polynomials
In (ToCT'20) Kumar surprisingly proved that every polynomial can be appr...
research
∙
12/21/2021
Efficient reductions and algorithms for variants of Subset Sum
Given (a_1, …, a_n, t) ∈ℤ_≥ 0^n + 1, the Subset Sum problem (𝖲𝖲𝖴𝖬) is to...
research
∙
10/27/2017
A note on faithful coupling of Markov chains
One often needs to turn a coupling (X_i, Y_i)_i≥ 0 of a Markov chain int...
research
∙
10/09/2017
