Author:
Ibarra Oscar H.,Rosier Louis E.
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Alt, H., Functions Equivalent to Integer Multiplication, Lecture Notes in Computer Science, No. 85: Automata, Languages and Programming (ICALP 80), Springer Verlag, 1980.
2. Cherniavsky, J., Simple Programs Realize Exactly Presburger Formulas, SIAM J. Comput. 5 (1976), pp. 666–677.
3. Cherniavsky, J. and Kamin, S., A Complete and Consistent Hoare Axiomatics for a Simple Programming Language, J. ACM, 26 (1979), pp. 119–128.
4. Constable, R., Hunt, H. and Sahni, S., On the Computational Complexity of Scheme Equivalence, Proc. 8th Ann. Princeton Conf. on Information Sciences Systems, Princeton, NJ, 1974.
5. Project Mac. Tech. Memo;M. Fischer,1974
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献