Volume 4,
1993
- José Luis Montaña, Luis Miguel Pardo:
Lower Bounds for Arithmetic Networks.
1-24
- Jean Conan, Gérald E. Séguin:
Structural Properties and Enumeration of Quasi Cyclic Codes.
25-39
- Hari Krishna:
On a Signal Processing Algorithms Based Class of Linear Codes.
41-57
- Reinhold Pieper:
Cryptanalysis of Rédei- and Dickson Permutations on Arbitary Finite Rings.
59-76
- J. A. Thiong-Ly:
A Serial Version of the Pohlig-Hellman Algorithm for Computing Discrete Logarithms.
77-80
- Harald Niederreiter:
A New Efficient Factorization Algorithm for Polynomial over Small Finite Fields.
81-87
- Ian F. Blake, Shuhong Gao, Ronald C. Mullin:
Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4.
89-94
- Philippe Langevin:
Almost Perfect Binary Functions.
95-102
- Maria Grazia Marinari, H. Michael Möller, Teo Mora:
Gröbner Bases of Ideals Defined by Functionals with an Application to Ideals of Projective Points.
103-145
- Alexander Bockmayr:
Conditional Narrowing Modulo of Set of Equations.
147-168
- Jan Verschelde, Ronald Cools:
Symbolic Homotopy Construction.
169-183
- Moulay A. Barkatou:
An Algorithm for Computing a Companion Block Dianonal Form for a System of Liniear Differential Equations.
185-195
- Abdallah Assi:
Standard Bases, Critical Tropisms and Flatness.
197-215
- H. Michael Möller:
On Decomposing Systems of Polynomial Equations with Finitely Many Solutions.
217-230
- Abdallah Assi, Teo Mora:
The Virtues of Laziness: Complexity of the Tangent Cone Algorithm.
231-238
- Laurent Gournay, Jean-Jacques Risler:
Construction of Roadmaps in Semi-Algebraic Sets.
239-252
- Rudolf Ahlswede, Ning Cai:
Rank Formulas for Certain Products of Matrices.
253-261
- Igor Shparlinski:
Finding Irreducible and Primitive Polynomials.
263-268
- Alexander A. Letichevsky, M. S. Lvov:
Discovery of Invariant Equalities in Programs over Data Fields.
269-286
Copyright © Tue Dec 1 16:27:54 2009
by Michael Ley (ley@uni-trier.de)
