Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://www.acm.org/pubs/toc/Abstracts/jacm/4250.html
Author:Meyer auf der Heide, Friedhelm
Description: 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.
Levels: College, Research
Languages: English
Resource Types: Articles
Math Topics: Number Theory

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.