Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. I. Borosh and L. B. Treybig. Bounds on positive integral solutions of linear diophantine equations. Proceedings of the American Mathematical Society, 55:299–304, 1976.
2. A. Boudet, E. Contejean, and H. Devie. A new AC unification algorithm with a new algorithm for solving diophantine equations. In Proceedings 5th IEEE Symposium on Logic in Computer Science, Philadelphia (Pennsylvania, USA), pages 289–299, 1990.
3. A. Brøndsted. An Introduction to Convex Polytopes, volume 90 of Graduate Texts in Mathematics. Springer-Verlag, 1983.
4. M. Clausen and A. Fortenbacher. Efficient solution of linear diophantine equations. Journal of Symbolic Computation, 8:201–216, 1989. Special issue on unification. Part two.
5. E. Contejean and H. Devie. Solving systems of linear diophantine equations. In H.-J. Bürckert and W. Nutt, editors, Proceedings 3rd International Workshop on Unification, Lambrecht (Germany), 1989.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Synchronization of Parikh Automata;Developments in Language Theory;2023
2. Geometric decision procedures and the VC dimension of linear arithmetic theories;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
3. From Feynman rules to conserved quantum numbers, III;Computer Physics Communications;2021-03
4. Typing regular path query languages for data graphs;Proceedings of the 15th Symposium on Database Programming Languages;2015-10-27
5. Lower bounds for testing triangle-freeness in Boolean functions;computational complexity;2014-11-06