Name
Abstract | ||
|---|---|---|
We consider the problem of correcting programs that compute multivariate polynomials over large finite fields and give an efficient procedure to transform any program that computes a multivariate polynomial f correctly on 1/2 + d fraction of its input (d |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0020-0190(92)90195-2 | Inf. Process. Lett. |
Keywords | Field | DocType |
resilient correctors,efficient procedure,large finite field,highly resilient correctors,multivariate polynomial,finite field | Autocorrection,Discrete mathematics,Finite field,Program transformation,Polynomial,Unit cost,Fault tolerance,Multivariate polynomials,Mathematics,Theory of computation | Journal |
Volume | Issue | ISSN |
43 | 4 | 0020-0190 |
Citations | PageRank | References |
77 | 16.53 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Gemmell | 1 | 675 | 108.87 |
| Madhu Sudan | 2 | 5616 | 591.68 |