Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, December 07, 2010, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Gyula Károlyi (Eötvös Loránd University)
We give an improved polynomial bound on the complexity of the equivalence problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics, which may be of independent interest.
Joint work with Csaba Szabo.
Automatic MiSe System Software Version 1.4803M | admin login