Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
ComputingReviews.com
  The computational complexity of simultaneous diophantine approximation problems
Lagarias J. SIAM Journal on Computing14(1):196-209,1985.Type:Article
 
  Published By: Society for Industrial and Applied Mathematics  
 
 
You can purchase an article without having a subscription.
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy