Back to Results
First PageMeta Content
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

Document Date: 2002-01-22 06:23:32


Open Document

File Size: 209,04 KB

Share Result on Facebook

Company

Ford / /

Country

Australia / /

Event

Product Recall / Product Issues / /

Facility

Information Technology The University of Queensland Queensland / Software Engineering University of Newcastle Callaghan / Mathematics The University of Queensland Queensland / /

IndustryTerm

gcd algorithm / lattice basis reduction algorithms / remainder gcd algorithm / normal form algorithm / extended gcd algorithm / normal form algorithms / /

MusicGroup

D12 / /

Organization

University of Queensland Queensland / Keith R. Matthews Department / Bohdan S. Majewski Department of Computer Science / Computer Science and Software Engineering University of Newcastle Callaghan / George Havas School / /

Person

Keith R. Matthews / /

Position

Prime Minister / give Pm / /

Product

Cowon D2+ Portable Audio Device / Then / /

Technology

normal form algorithm / LLL lattice basis reduction algorithms / limiting algorithm / 4 Algorithm / remainder gcd algorithm / Information Technology / time algorithm / LLL algorithm / extended gcd algorithm / 2 The LLL algorithm / normal form algorithms / sorting gcd algorithm / gcd algorithm / /

URL

http /

SocialTag