Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. S. Ar, M. Blum, B. Codenotti, and P. Gemmell, “Checking Approximate Computations Over the Reals.” to appear in STOC 93, 10 pp.
2. L. Babai, “E-mail and the power of interaction,” Proc 5th Structures in Complexity Theory Conference, (1990).
3. R. Beigel, personal communication.
4. M. Blum, “Designing Program to Check their Work,” ICSI Tech. Report TR-88-009.
5. M. Blum and S. Kannan, “Designing Programs that Check Their Work,” Proc. 21st ACM STOC (1989).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Certifying algorithms;Computer Science Review;2011-05
2. Problem identification using program checking;Discrete Applied Mathematics;2004-12