Sciweavers

Share
ECCC
2011
282views ECommerce» more  ECCC 2011»
10 years 6 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
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...
Noga Alon, Shachar Lovett
ECCC
2011
234views ECommerce» more  ECCC 2011»
10 years 6 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
ECCC
2011
223views ECommerce» more  ECCC 2011»
10 years 6 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
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 ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
ECommerce
Top of PageReset Settings
books