Agrawal, Manindra (2003) On derandomizing tests for certain polynomial identities Proceedings of 18th Annual IEEE Conference on Computational Complexity . pp. 355-359. ISSN 1093-0159
![[img]](https://repository.ias.ac.in/style/images/fileicons/application_pdf.png)
|
PDF
- Author Version
76kB |
Official URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?...
Related URL: http://dx.doi.org/10.1109/CCC.2003.1214434
Abstract
We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to IEEE. |
| ID Code: | 92019 |
| Deposited On: | 26 May 2012 13:52 |
| Last Modified: | 19 May 2016 05:36 |
Repository Staff Only: item control page
