1. Decompositions of algebras over ℝ and ℂ

   • Wayne Eberly

   OriginalPaper Pages: 211 - 234

2. Existence and efficient construction of fast Fourier transforms on supersolvable groups

   • Ulrich Baum

   OriginalPaper Pages: 235 - 256

3. Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs

   • Michael D. Hirsch

   OriginalPaper Pages: 257 - 268

4. Three ∑ _P ² -complete problems in computational learning theory

   • Ker-I Ko
   • Wen-Guey Tzeng

   OriginalPaper Pages: 269 - 310