IL VANTAGGIO DI OPERARE IN UN AMBIENTE FINITO
Abstract
Full Text:
PDFReferences
l R. BOGEN, Affacsyma Reference Aff/alma], The Mathlab Group Laboratory For Computers Science M.1.T. Version 1983.
J. CALMET, R. LOOS. Deterministic Versus Probabilistic Factorization of integral Polinomials 1981.
D. S. HIRSCHBERG. C. k. WONG. A polinomial Time Algorithm for the Knapsack Problem with two variables, J ACM 1976.
E. KALTOFEN. NEWARK. DELAWARE, Factorization of polynomials. Computing, Suppl. 1982.
S D… E. KNUTH. The Art of Computer Programming, (vol. 2)- Addison Wesley 1969.
R. LOOS. Computing Rationals Zeros of integral Polinomials by padic Expantion-SIAM J. Computing 1983.
R. PAVELLE. M. ROTHSTEIN. J.F1TCH, Computer Algebra, Scientific American 198].
R. H. RAND. Computer Algebra in Applied Mathematics, An introduction to Macsyma-Research Notes in Mathematics n… 94. Pitman Advanced Publishing Program 1984.
D. Y. Y. YUNG, Algebraic Algorithms using p-adic Construction, ACM Symposium 1976.
Refbacks
- There are currently no refbacks.
Copyright (c) 1996 Franco Eugeni
This work is licensed under a Creative Commons Attribution 4.0 International License.
Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.