Jelenlegi hely
Rendkívüli szeminárium
Félév:
2015/16 I. félév
Helyszín:
Árpád tér 2. II. em. 220. sz.
Dátum:
2015-11-06
Időpont:
14:00-15:00
Előadó:
Arnold Neumaier (University of Vienna)
Cím:
Integer least squares and basis reduction
Absztrakt:
The solution of integer least squares problems is closely related
to certain lattice problems, in particular the closest vector
problem and basis reduction. Applications in parameter estimation
problems have different characteristics from those in number theory,
computer algebra, or cryptography in that the initial basis is
known only to limited accuracy, and the demands on the quality
of the solution are therefore moderate only.
In this lecture I'll give an introduction to the problem,
outline some methods and their properties, and give a new
complexity analysis for the famous LLL algorithm.