Computational Indistinguishability: A Sample Hierarchy
作者：
Highlights：
•
摘要
We consider the existence of pairs of probability ensembles that may be efficiently distinguished given k samples, but cannot be efficiently distinguished given k′
论文关键词：computational indistinguishability,polynomials,extractors,expanders,eigenvalues,rapid mixing
论文评审过程：Received 21 July 1998, Revised 30 April 1990, Available online 25 May 2002.
论文官网地址：https://doi.org/10.1006/jcss.1999.1652
