Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
A probabilistic test for equality a=bc for given n-bit integers a,b,c is designed within complexity n(loglogn)exp{O(log^*n)}.