Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia

First Page		Document Content
Date: 2002-01-22 06:23:32 Algebra Abstract algebra Lie groups Euclidean algorithm Lenstra–Lenstra–Lovász lattice basis reduction algorithm Lattice reduction Lattice Hungarian algorithm Mathematics Computational number theory Lattice points		Extended gcd and Hermite normal form algorithms via lattice basis reduction George Havas School of Information Technology The University of Queensland Queensland 4072, Australia Add to Reading List Source URL: www.numbertheory.org Download Document from Source Website File Size: 209,04 KB Share Document on Facebook

	Bandit based Monte-Carlo Planning Levente Kocsis and Csaba Szepesv´ari Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u, 1111 Budapest, Hungary DocID: 1pGal - View Document
	Weighted Synergy Graphs for Role Assignment in Ad Hoc Heterogeneous Robot Teams Somchaya Liemhetcharat and Manuela Veloso School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA a DocID: 1phC2 - View Document
	123 Documenta Math. Discrete Optimization Stories DocID: 1p15X - View Document
	Fine-Grained Complexity and Algorithm Design Boot Camp Parameterized Reductions Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) DocID: 1muZB - View Document