1. On decomposing systems of polynomial equations with finitely many solutions

   • H. Michael Möller

   OriginalPaper Pages: 217 - 230

2. The virtues of laziness: Complexity of the Tangent Cone Algorithm

   • Abdallah Assi
   • Teo Mora

   OriginalPaper Pages: 231 - 238

3. Construction of roadmaps in semi-algebraic sets

   • L. Gournay
   • J. J. Risler

   OriginalPaper Pages: 239 - 252

4. Rank formulas for certain products of matrices

   • Rudolf Ahlswede
   • Ning Cai

   OriginalPaper Pages: 253 - 261

5. Finding irreducible and primitive polynomials

   • Igor E. Shparlinski

   OriginalPaper Pages: 263 - 268

6. Discovery of invariant equalities in programs over data fields

   • A. A. Letichevsky
   • M. S. Lvov

   OriginalPaper Pages: 269 - 286