Henselian rings

Thursday, October 26, 2006 - 10:50am - 11:40am
Grégoire Lecerf (Université Versailles/Saint Quentin-en-Yvelines)
Multivariate polynomial factorization algorithms are necessary ingredients to several tasks in computational algebraic geometry such as prime and primary decompositions. They are also extremely useful in many places where they are not necessary but where they lead to major speedups by splitting problems into several smaller ones.
Subscribe to RSS - Henselian rings