⇤ ← Revision 1 as of 20080922 08:59:13
1801
Comment: Eric Schost Abstract

← Revision 2 as of 20081114 13:41:59 ⇥
1801
converted to 1.6 markup

No differences found! 
Triangular representations are a versatile data structure for computing with polynomial systems; they are typically well adapted to handle configurations featuring some form of geometric content. Even though algorithms for computing triangular representations have been known for a while, it is however only recently that the focus has been put on "asymptotically fast" algorithms and their complexity.
We will review a few basic tools and algorithms, such as duality, lifting techniques, or computations in a product of fields. A special attention will be paid to what is probably the first nontrivial operation, multiplication modulo a triangular set.