Search for Author All Reviews
	Lagarias, J     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       Polynomial time algorithms for finding integer relations among real numbers Håstad J., Just B., Lagarias J., Schnorr C. SIAM Journal on Computing 18(5): 859-881, 1989.  Type: Article All algorithms shown in this paper use as their main idea the Lattice Basis Reduction Algorithm introduced by Lenstra, Lenstra Jr., and Lovász [1]. The authors demonstrate several algorithms related to the following problem: &...... Dec 1 1990     Algorithms for packing squares: a probabilistic analysis E. G. J., Lagarias J. SIAM Journal on Computing 18(1): 166-185, 1989.  Type: Article This paper discusses the problem of packing a collection of squares into a semi-infinite strip of unit width or into a series of bins of unit height and width. The authors provide algorithms for the packing process for each case and co...... Oct 1 1989     The computational complexity of simultaneous diophantine approximation problems Lagarias J. SIAM Journal on Computing 14(1): 196-209, 1985.  Type: Article This paper considers the computational complexity of algorithms to find good simultaneous approximations to a given vector of d rational numbers. Such problems have a number of important applications. The goodness of an approxim...... Jan 1 1986
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy