Author:
Cai Jin-Yi,Pavan A.,Sivakumar D.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. A. Amir, R. Beigel, and W. Gasarch. Some connections between query classes and non-uniform complexity. In Proceedings of the 5th Structure in Complexity Theory, pages 232–243. IEEE Computer Society, 1990.
2. S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan. Reconstructing algebraic functions from mixed data. In Proc. 33rd FOCS, pages 503–512, 1992.
3. E. Berlekamp and L. Welch. Error correction of algebraic codes. US Patent Number 4,633,470.
4. J. Cai and L. Hemachandra. A note on enumerative counting. Information Processing Letters, 38(4):215–219, 1991.
5. U. Feige and C. Lund. On the hardness of computing permanent of random matrices. In Proceedings of 24th STOC, pages 643–654, 1992.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献