Abstract
We give new bounds and algorithms for minimal solutions of linear diophantine systems. These bounds are simply exponential, while previous known bounds were, at least until recently, doubly exponential.
Cite
CITATION STYLE
APA
Pottier, L. (1991). Minimal solutions of linear diophantine systems: Bounds and algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 488 LNCS, pp. 162–173). Springer Verlag. https://doi.org/10.1007/3-540-53904-2_94
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free