Debian Codegraph @

doc/algo-ca-book.html

raw
1 <?xml version="1.0" encoding="iso-8859-1"?>
2 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
3 "DTD/xhtml1-transitional.dtd">
4 <html xmlns="http://www.w3.org/1999/xhtml">
5 <head>
6 <link rel="stylesheet" type="text/css" href="html.css" />
7 <title>JAS - Algorithms for Computer Algebra book</title>
8 </head>
9 <body class="main">
10 <h1>Algorithms for Computer Algebra book and JAS methods</h1>
11
12 <p>
13 Summary of algorithms from the
14 <a href="http://www.springer.com/computer/theoretical+computer+science/book/978-0-7923-9259-0"
15 target="gbb">Algorithms for Computer Algebra</a>
16 book and corresponding JAS classes and methods.
17 </p>
18
19
20 <h2>Algorithms for Computer Algebra book</h2>
21
22 <p>
23 The JAS base package <code>edu.jas</code> name is omitted in the
24 following table.
25 JAS also contains improved versions of the algorithms which may be located through the links.
26 A short explanation of code organization with interfaces and several implementing classes
27 can be found in the <a href="design.html">API guide</a>.
28 </p>
29
30 <table border="1" cellpadding="3" summary="Algo CA book to JAS summary" >
31 <tr>
32 <td>Algorithms&nbsp;for&nbsp;Computer&nbsp;Algebra</td>
33 <td>JAS interfaces, classes and methods</td>
34 <td>remarks</td>
35 </tr>
36
37 <tr>
38 <td>2.1&nbsp;Euclidean Algorithm, <code>Euclid</code></td>
39 <td><a href="api/edu/jas/structure/RingElem.html#gcd(C)" target="classFrame"><code>structure.RingElem.gcd</code></a>
40 </td>
41 <td>all classes which implement this interface
42 </td>
43 </tr>
44 <tr>
45 <td>2.2&nbsp;Extended Euclidean Algorithm, <code>EEA</code></td>
46 <td><a href="api/edu/jas/structure/RingElem.html#egcd(C)" target="classFrame"><code>structure.RingElem.egcd</code></a>
47 </td>
48 <td>all classes which implement this interface
49 </td>
50 </tr>
51
52 <tr>
53 <td>2.3&nbsp;Primitive Euclidean Algorithm, <code>PrimitiveEuclidean</code></td>
54 <td><a href="api/edu/jas/ufd/GreatestCommonDivisorPrimitive.html" target="classFrame"><code>ufd.GreatestCommonDivisorPrimitive</code></a>
55 </td>
56 <td>
57 </td>
58 </tr>
59
60 <tr>
61 <td colspan="3">&nbsp;</td>
62 </tr>
63
64 <tr>
65 <td>4.1&nbsp;Multiprecision Integer Multiplication, <code>BigIntegerMultiply</code></td>
66 <td><a href="api/edu/jas/arith/BigInteger.html#multiply(edu.jas.arith.BigInteger)" target="classFrame"><code>BigInteger.multiply</code></a>
67 </td>
68 <td>adapter for native Java implementation in <code>java.math.BigInteger.multiply</code>
69 </td>
70 </tr>
71
72 <tr>
73 <td>4.2&nbsp;Karatsuba's Multiplication Algorithm, <code>Karatsuba</code></td>
74 <td><a href="api/edu/jas/arith/" target="classFrame"><code></code></a>
75 </td>
76 <td>implemented in <code>java.math.BigInteger.multiply</code>
77 </td>
78 </tr>
79
80 <tr>
81 <td>4.3&nbsp;Polynomial Trial Division Algorithm, <code>TrialDivision</code></td>
82 <td>not implemented
83 </td>
84 <td>see
85 <a href="api/edu/jas/poly/GenPolynomial.html#divide(edu.jas.poly.GenPolynomial)" target="classFrame"><code>GenPolynomial.divide</code></a>
86 and
87 <a href="api/edu/jas/poly/PolyUtil.html#basePseudoDivide(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>PolyUtil.basePseudoDivide</code></a>
88 </td>
89 </tr>
90
91 <tr>
92 <td>4.4&nbsp;Fast Fourier Transform, <code>FFT</code></td>
93 <td><a href="api/edu/jas/" target="classFrame"><code></code></a>
94 not implemented
95 </td>
96 <td>
97 </td>
98 </tr>
99
100 <tr>
101 <td>4.5&nbsp;Fast Fourier Polynomial Multiplication, <code>FFT_Multiply</code></td>
102 <td><a href="api/edu/jas/" target="classFrame"><code></code></a>
103 not implemented
104 </td>
105 <td>
106 </td>
107 </tr>
108
109 <tr>
110 <td>4.6&nbsp;Newtons's Method for Power Series Inversion, <code>FastNewtonInversion</code></td>
111 <td>not implemented
112 </td>
113 <td>see
114 <a href="api/edu/jas/ps/UnivPowerSeries.html#inverse()" target="classFrame"><code>UnivPowerSeries.inverse()</code></a>
115 and
116 <a href="api/edu/jas/ps/MultiVarPowerSeries.html#inverse()" target="classFrame"><code>MultiVarPowerSeries.inverse()</code></a>
117 </td>
118 </tr>
119
120 <tr>
121 <td>4.7&nbsp;Newtons's Method for Solving P(y) = 0, <code>NewtonSolve</code></td>
122 <td>not implemented
123 </td>
124 <td>see
125 <a href="api/edu/jas/ps/UnivPowerSeriesRing.html#solveODE(edu.jas.ps.UnivPowerSeries,%20C)" target="classFrame"><code>UnivPowerSeriesRing.solveODE()</code></a>
126 </td>
127 </tr>
128
129 <tr>
130 <td colspan="3">&nbsp;</td>
131 </tr>
132
133 <tr>
134 <td>5.1&nbsp;Garner's Chinese Remainder Algorithm, <code>IntegerCRA</code></td>
135 <td><a href="api/edu/jas/arith/ModIntegerRing.html#chineseRemainder(edu.jas.arith.ModInteger,%20edu.jas.arith.ModInteger,%20edu.jas.arith.ModInteger)" target="classFrame"><code>ModIntegerRing.chineseRemainder()</code></a>
136 </td>
137 <td>only for two moduli
138 </td>
139 </tr>
140
141 <tr>
142 <td>5.2&nbsp;Newtons Interpolation Algorithm, <code>NewtonInterp</code></td>
143 <td>not implemented
144 </td>
145 <td>see
146 <a href="api/edu/jas/poly/PolyUtil.html#chineseRemainder(edu.jas.poly.GenPolynomialRing,%20edu.jas.poly.GenPolynomial,%20C,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>PolyUtil.chineseRemainder()</code></a>
147 and
148 <a href="api/edu/jas/poly/PolyUtil.html#interpolate(edu.jas.poly.GenPolynomialRing,%20edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial,%20C,%20C,%20C)" target="classFrame"><code>PolyUtil.interpolate()</code></a>
149 </td>
150 </tr>
151
152 <tr>
153 <td colspan="3">&nbsp;</td>
154 </tr>
155
156 <tr>
157 <td>6.1&nbsp;Univariate Hensel Lifting Algorithm, <code>UnivariateHensel</code></td>
158 <td><a href="api/edu/jas/ufd/HenselUtil.html#liftHensel(edu.jas.poly.GenPolynomial,%20java.util.List,%20long,%20edu.jas.arith.BigInteger)" target="classFrame"><code>HenselUtil.liftHensel()</code></a>
159 </td>
160 <td>
161 </td>
162 </tr>
163
164 <tr>
165 <td>6.2&nbsp;Multivariate Polynomial Diophantine Equantions, <code>MultivariateDiophant</code></td>
166 <td><a href="api/edu/jas/ufd/HenselMultUtil.html#liftDiophant(java.util.List,%20edu.jas.poly.GenPolynomial,%20java.util.List,%20long,%20long)" target="classFrame"><code>HenselMultUtil.liftDiophant()</code></a>
167 </td>
168 <td>
169 </td>
170 </tr>
171
172 <tr>
173 <td>6.3&nbsp;Univariate Polynomial Diophantine Equantions, <code>UnivariateDiophant</code></td>
174 <td><a href="api/edu/jas/ufd/HenselUtil.html#liftDiophant(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial,%20long,%20long)" target="classFrame"><code>HenselUtil.liftDiophant()</code></a>
175 </td>
176 <td>
177 </td>
178 </tr>
179
180 <tr>
181 <td>6.4&nbsp;Multivariate Hensel Lifting Algorithm, <code>MultivariateHensel</code></td>
182 <td><a href="api/edu/jas/ufd/HenselMultUtil.html#liftHensel(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial,%20java.util.List,%20java.util.List,%20long,%20java.util.List)" target="classFrame"><code>HenselMultUtil.liftHensel()</code></a>
183 </td>
184 <td>
185 </td>
186 </tr>
187
188 <tr>
189 <td colspan="3">&nbsp;</td>
190 </tr>
191
192 <tr>
193 <td>7.1&nbsp;Modular GCD Algorithm, <code>MGCD</code></td>
194 <td><a href="api/edu/jas/ufd/GreatestCommonDivisorModular.html#baseGcd(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>GreatestCommonDivisorModular.</code> <code>baseGcd()</code></a>
195 </td>
196 <td>
197 </td>
198 </tr>
199
200 <tr>
201 <td>7.2&nbsp;Multivariate GCD Reduction Algorithm, <code>PGCD</code></td>
202 <td><a href="api/edu/jas/ufd/GreatestCommonDivisorModEval.html#gcd(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>GreatestCommonDivisorModEval.gcd()</code></a>
203 </td>
204 <td>
205 </td>
206 </tr>
207
208 <tr>
209 <td></td>
210 <td><a href="api/edu/jas/ufd/GreatestCommonDivisorSubres.html#gcd(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>GreatestCommonDivisorSubres.gcd()</code></a>
211 </td>
212 <td>many more algorithms, for example using polynomial remainder sequences
213 (PRS), in particular a sub-resultant PRS
214 </td>
215 </tr>
216
217 <tr>
218 <td>7.3&nbsp;Extended Zassenhaus GCD Algorithm, <code>EZ-GCD</code></td>
219 <td><a href="api/edu/jas/ufd/GreatestCommonDivisorHensel.html#recursiveUnivariateGcd(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>GreatestCommonDivisorHensel.</code> <code>recursiveUnivariateGcd()</code></a>
220 </td>
221 <td>not complete in all cases
222 </td>
223 </tr>
224
225 <tr>
226 <td>7.4&nbsp;GCD Heuristic Algorithm, <code>GCDHEU</code></td>
227 <td>not implemented
228 </td>
229 <td>
230 </td>
231 </tr>
232
233 <tr>
234 <td colspan="3">&nbsp;</td>
235 </tr>
236
237 <tr>
238 <td>8.1&nbsp;Square-Free Factorization, <code>SquareFree</code></td>
239 <td><a href="api/edu/jas/ufd/SquarefreeFieldChar0.html#squarefreeFactors(edu.jas.poly.GenPolynomial)" target="classFrame"><code>SquarefreeFieldChar0.</code> <code>squarefreeFactors()</code></a>
240 </td>
241 <td>
242 </td>
243 </tr>
244
245 <tr>
246 <td>8.2&nbsp;Yun's Square-Free Factorization, <code>SquareFree2</code></td>
247 <td><a href="api/edu/jas/ufd/SquarefreeFieldChar0Yun.html#squarefreeFactors(edu.jas.poly.GenPolynomial)" target="classFrame"><code>SquarefreeFieldChar0Yun.</code> <code>squarefreeFactors()</code></a>
248 </td>
249 <td>
250 </td>
251 </tr>
252
253 <tr>
254 <td>8.3&nbsp;Finite Field Square-Free Factorization, <code>SquareFreeFF</code></td>
255 <td><a href="api/edu/jas/ufd/SquarefreeFiniteFieldCharP.html#squarefreeFactors(edu.jas.poly.GenPolynomial)" target="classFrame"><code>SquarefreeFiniteFieldCharP.</code> <code>squarefreeFactors()</code></a>
256 </td>
257 <td>
258 </td>
259 </tr>
260
261 <tr>
262 <td></td>
263 <td><a href="api/edu/jas/ufd/SquarefreeInfiniteFieldCharP.html#squarefreeFactors(edu.jas.ufd.Quotient)" target="classFrame"><code>SquarefreeInfiniteFieldCharP.</code> <code>squarefreeFactors()</code></a>
264 </td>
265 <td>Algorithm for infinite fields of characteristic p, not in the book.
266 </td>
267 </tr>
268
269 <tr>
270 <td>8.4&nbsp;Berlekamp's Factorization Algorithm, <code>Berlekamp</code></td>
271 <td><a href="api/edu/jas/ufd/FactorModularBerlekamp.html#baseFactorsSquarefree(edu.jas.poly.GenPolynomial)" target="classFrame"><code>FactorModularBerlekamp.</code> <code>baseFactorsSquarefree()</code></a>
272 </td>
273 <td>The method <code>baseFactorsSquarefreeSmallPrime()</code> contains the implementation.
274 </td>
275 </tr>
276
277 <tr>
278 <td>8.5&nbsp;Form Q Matrix, <code>FormMatrixQ</code></td>
279 <td><a href="api/edu/jas/ufd/PolyUfdUtil.html#constructQmatrix(edu.jas.poly.GenPolynomial)" target="classFrame"><code>PolyUfdUtil.constructQmatrix()</code></a>
280 </td>
281 <td>
282 </td>
283 </tr>
284
285 <tr>
286 <td>8.6&nbsp;Null Space Basis Algorithm, <code>NullSpaceBasis</code></td>
287 <td><a href="api/edu/jas/vector/LinAlg.html#nullSpaceBasis(edu.jas.vector.GenMatrix)" target="classFrame"><code>LinAlg.nullSpaceBasis()</code></a>
288 </td>
289 <td>
290 </td>
291 </tr>
292
293 <tr>
294 <td>8.7&nbsp;Big Prime Berlekamp Factoring Algorithm, <code>BigPrimeBerlekamp</code></td>
295 <td><a href="api/edu/jas/ufd/FactorModularBerlekamp.html#baseFactorsSquarefree(edu.jas.poly.GenPolynomial)" target="classFrame"><code>FactorModularBerlekamp.</code> <code>baseFactorsSquarefree()</code></a>
296 </td>
297 <td>The method <code>baseFactorsSquarefreeBigPrime()</code> contains the implementation.
298 </td>
299 </tr>
300
301 <tr>
302 <td>8.8&nbsp;Distinct Degree Factorization I, <code>PartialFactorDD</code></td>
303 <td><a href="api/edu/jas/ufd/FactorModular.html#baseDistinctDegreeFactors(edu.jas.poly.GenPolynomial)" target="classFrame"><code>FactorModular.</code> <code>baseDistinctDegreeFactors()</code></a>
304 </td>
305 <td>
306 </td>
307 </tr>
308
309 <tr>
310 <td>8.9&nbsp;Distinct Degree Factorization II, <code>SplitDD</code></td>
311 <td><a href="api/edu/jas/ufd/FactorModular.html#baseEqualDegreeFactors(edu.jas.poly.GenPolynomial)" target="classFrame"><code>FactorModular.</code> <code>baseEqualDegreeFactors()</code></a>
312 </td>
313 <td>
314 </td>
315 </tr>
316
317 <tr>
318 <td></td>
319 <td><a href="api/edu/jas/ufd/FactorInteger.html#factorsSquarefree(edu.jas.poly.GenPolynomial)" target="classFrame"><code>FactorInteger.factorsSquarefree()</code></a>
320 </td>
321 <td>Algorithm of P. Wang, not presented in the book.
322 </td>
323 </tr>
324
325 <tr>
326 <td>8.10&nbsp;Factorization over Algebraic Number Fields, <code>AlgebraicFactorization</code></td>
327 <td><a href="api/edu/jas/ufd/FactorAlgebraic.html#baseFactorsSquarefree(edu.jas.poly.GenPolynomial)" target="classFrame"><code>FactorAlgebraic.</code> <code>baseFactorsSquarefree()</code></a>
328 </td>
329 <td>
330 </td>
331 </tr>
332
333 <tr>
334 <td colspan="3">&nbsp;</td>
335 </tr>
336
337 <tr>
338 <td>9.1&nbsp;Fraction-Free Gaussian Elimination, <code>FractionFreeElim</code></td>
339 <td><a href="api/edu/jas/vector/LinAlg.html#fractionfreeGaussElimination(edu.jas.vector.GenMatrix)" target="classFrame"><code>LinAlg.</code> <code>fractionfreeGaussElimination()</code></a>
340 </td>
341 <td>see also
342 <a href="api/edu/jas/gbufd/GroebnerBasePseudoSeq.html#GB(int,%20java.util.List)" target="classFrame"><code>GroebnerBasePseudoSeq.GB()</code></a>
343 </td>
344 </tr>
345
346 <tr>
347 <td>9.2&nbsp;Nonlinear Elimination Algorithm, <code>NonlinearElim</code></td>
348 <td><a href="api/edu/jas/" target="classFrame"><code></code></a>
349 not implemented
350 </td>
351 <td>Based on iterated resultant computations.
352 See also the characteristic set method
353 <a href="api/edu/jas/gbufd/CharacteristicSetSimple.html#characteristicSet(java.util.List)" target="classFrame"><code>CharacteristicSetSimple.characteristicSet()</code></a>
354 </td>
355 </tr>
356
357 <tr>
358 <td>9.3&nbsp;Solution of Nonlinear System of Equations, <code>NonlinearSolve</code></td>
359 <td><a href="api/edu/jas/" target="classFrame"><code></code></a>
360 not implemented
361 </td>
362 <td>Based on resultant computations and algebraic root substitution.
363 See also the ideal complex and real root computation and decomposition methods
364 <a href="api/edu/jas/application/PolyUtilApp.html#complexAlgebraicRoots(edu.jas.application.Ideal)" target="classFrame"><code>PolyUtilApp.complexAlgebraicRoots()</code></a>
365 </td>
366 </tr>
367
368 <tr>
369 <td colspan="3">&nbsp;</td>
370 </tr>
371
372 <tr>
373 <td>10.1&nbsp;Full Reduction Algorithm, <code>Reduce</code></td>
374 <td><a href="api/edu/jas/gb/Reduction.html#normalform(java.util.List,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>Reduction.normalform()</code></a>
375 </td>
376 <td>all classes which implement this interface
377 </td>
378 </tr>
379
380 <tr>
381 <td>10.2&nbsp;Buchbergers's Algorithm for Gr&ouml;bner Bases, <code>Gbasis</code></td>
382 <td><a href="api/edu/jas/" target="classFrame"><code></code></a>
383 not implemented
384 </td>
385 <td>
386 </td>
387 </tr>
388
389 <tr>
390 <td>10.3&nbsp;Construction of a Reduced Ideal Basis, <code>ReduceSet</code></td>
391 <td><a href="api/edu/jas/gb/GroebnerBase.html#minimalGB(java.util.List)" target="classFrame"><code>GroebnerBase.minimalGB()</code></a>
392 </td>
393 <td>all classes which implement this interface
394 </td>
395 </tr>
396
397 <tr>
398 <td>10.4&nbsp;Improved Construction of a Reduced Gr&ouml;bner Basis, <code>Gbasis</code></td>
399 <td><a href="api/edu/jas/gb/GroebnerBaseSeq.html#GB(int,%20java.util.List)" target="classFrame"><code>GroebnerBaseSeq.GB()</code></a>
400 </td>
401 <td>can be parametrized also with different strategies, e.g. Gebauer &amp; M&ouml;ller
402 </td>
403 </tr>
404
405 <tr>
406 <td>10.5&nbsp;Solution of System P in Variable x, <code>Solve1</code></td>
407 <td><a href="api/edu/jas/application/Ideal.html#constructUnivariate(int)" target="classFrame"><code>Ideal.constructUnivariate()</code></a>
408 </td>
409 <td>univariate polynomials of minimal degree in the ideal
410 </td>
411 </tr>
412
413 <tr>
414 <td>10.6&nbsp;Complete Solution of System P, <code>Gr&ouml;bnerSolve</code></td>
415 <td><a href="api/edu/jas/application/Ideal.html#zeroDimDecomposition()" target="classFrame"><code>Ideal.zeroDimDecomposition()</code></a>,
416 </td>
417 <td>univariate polynomials in the ideal are irreducible
418 </td>
419 </tr>
420
421 <tr>
422 <td>10.7&nbsp;Solution of P using Lexicographic Gr&ouml;bner Basis, <code>LexSolve</code></td>
423 <td><a href="api/edu/jas/application/Ideal.html#zeroDimRootDecomposition()" target="classFrame"><code>Ideal.zeroDimRootDecomposition()</code></a>
424 </td>
425 <td>additionally to 10.6, the ideal basis consists of maximally bi-variate polynomials
426 </td>
427 </tr>
428
429 <tr>
430 <td colspan="3">&nbsp;</td>
431 </tr>
432
433 <tr>
434 <td>11.1&nbsp;Hermite's Method for Rational Functions, <code>HermiteReduction</code></td>
435 <td><a href="api/edu/jas/integrate/ElementaryIntegration.html#integrateHermite(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>ElementaryIntegration.</code> <code>integrateHermite()</code></a>
436 </td>
437 <td>
438 </td>
439 </tr>
440
441 <tr>
442 <td>11.2&nbsp;Horowitz's Reduction for Rational Functions, <code>HorowitzReduction</code></td>
443 <td><a href="api/edu/jas/integrate/ElementaryIntegration.html#integrate(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>ElementaryIntegration.integrate()</code></a>
444 </td>
445 <td>
446 </td>
447 </tr>
448
449 <tr>
450 <td>11.3&nbsp;Rothstein/Trager method, <code>LogarithmicPartIntegral</code></td>
451 <td><a href="api/edu/jas/integrate/ElementaryIntegration.html#integrateLogPart(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>ElementaryIntegration.</code> <code>integrateLogPart()</code></a>
452 </td>
453 <td>using resultants
454 </td>
455 </tr>
456
457 <tr>
458 <td>11.4&nbsp;Lazard/Rioboo/Trager improvement, <code>LogarithmicPartIntegral</code></td>
459 <td><a href="api/edu/jas/integrate/ElementaryIntegrationLazard.html#integrateLogPart(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>ElementaryIntegrationLazard.</code> <code>integrateLogPart()</code></a>
460 </td>
461 <td>using sub-resultants
462 </td>
463 </tr>
464
465 <tr>
466 <td>11.x&nbsp;Czichowski variant, <code>LogarithmicPartIntegral</code></td>
467 <td><a href="api/edu/jas/integrate/ElementaryIntegrationCzichowski.html#integrateLogPart(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>ElementaryIntegrationCzichowski.</code> <code>integrateLogPart()</code></a>
468 </td>
469 <td>using Gr&ouml;bner bases
470 </td>
471 </tr>
472
473 <tr>
474 <td>11.y&nbsp;Bernoulli variant, <code>LogarithmicPartIntegral</code></td>
475 <td><a href="api/edu/jas/integrate/ElementaryIntegrationBernoulli.html#integrateLogPart(edu.jas.poly.GenPolynomial,%20edu.jas.poly.GenPolynomial)" target="classFrame"><code>ElementaryIntegrationBernoulli.</code> <code>integrateLogPart()</code></a>
476 </td>
477 <td>using absolute factorization into linear factors
478 </td>
479 </tr>
480
481 </table>
482
483 <p>
484 </p>
485
486
487 <!--
488 not implemented
489 <code></code>
490 <p>
491 </p>
492 <p>
493 </p>
494 <pre>
495 </pre>
496 -->
497
498 <p><!--a href="README" target="readme" >README</a-->
499 <!--a href="" target="classFrame"><code></code></a-->
500 </p>
501
502 <hr />
503 <address><a href="mailto:kredel at rz.uni-mannheim.de">Heinz Kredel</a></address>
504 <p>
505 <!-- Created: Sun May 23 13:14:59 CEST 2010 -->
506 <!-- hhmts start -->
507 Last modified: Sat Aug 7 19:41:34 CEST 2021
508 <!-- hhmts end -->
509 </p>
510 <!--p align="right" >
511 $Id$
512 </p-->
513 </body>
514 </html>