Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Meyer auf der Heide, Friedhelm|
|Abstract: a lower bound for the complexity of solving linear Diophantine equations such as knapsack problems on an idealised computer. From the Journal of the ACM, Vol.32, No. 4 (Oct. 1985), pp. 929-937.|
|Math Topics:||Number Theory|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.