Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Calculation of Minkowski-reduced lattice bases
Afflerbach L., Grothe H. Computing35 (3-4):269-276,1985.Type:Article
Date Reviewed: Aug 1 1986

The authors give, in outline form, an algorithm to calculate Minkowski-reduced lattice bases for arbitrarily large dimension. They claim that, using their method, a VAX-11/780 required 60 CPU seconds to calculate all such bases from dimensions 2 to 15. There are no details of the input data.
Reviewer:  A. D. Booth Review #: CR110559
Bookmark and Share
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
 
Probabilistic Computation (F.1.2 ... )
 
 
Random Number Generation (G.3 ... )
 
 
Reducibility And Completeness (F.1.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Nonnumerical Algorithms And Problems": Date
Improving the performance guarantee for approximate graph coloring
Wigderson A. Journal of the ACM 30(4): 729-735, 1983. Type: Article		 Feb 1 1985
Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
Demel J., Demlová M., Koubek V. Theoretical Computer Science 36(2-3): 203-216, 1985. Type: Article		 Jan 1 1986
Complexity of the word problem for commutative semigroups of fixed dimension
Huynh D. Acta Informatica 22(4): 421-432, 1985. Type: Article		 May 1 1986
more...
E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use | Privacy Policy