199
click to vote
ECCC
15 years 2 days ago
2011
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
178
click to vote
ECCC
15 years 20 days ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
234
click to vote
ECCC
15 years 20 days ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
169
Voted
ECCC
15 years 17 days ago
2011 |