An embedding algorithm for algebraic congruence function fields

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An embedding algorithm for algebraic congruence function fields

Full text

Pdf (218 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1991 international symposium on Symbolic and algebraic computation table of contents

Bonn, West Germany

Pages: 187 - 188

Year of Publication: 1991

ISBN:0-89791-437-6

Author

Joacheim Schmitt

Universität des Saarlandes, 6600 Saarbrücken, Germany

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 11, Citation Count: 1

Additional Information:

references cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120721 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	E.R. Berlekamp, Fact. Polynomials Over Large Finite Fields, Math. Comp. 24 (1970), pp 713-735.
	2	R. Böffgen , M. A. Reichert, Computing the decomposition of primes p and p-adic absolute values in semi-single algebras over Q, Journal of Symbolic Computation, v.4 n.1, p.3-10, August 1987 [doi>10.1016/S0747-7171(87)80048-2]
	3	R. BSffgen, Der Algorithmus yon Ford/Zassenhaus, Ann. Univ. Saraviensis, Ser. Math. 1 no. 3 (1987).
	4	J. Buchmann and H.W. Lenstra Jr., Computing maximal orders and factoring over Zp, to appear.
	5	D. Cantor and H. Zassenhaus, A new algorithm for fact. polyn, over finite fields, Math. Comp. 36 (1981).
	6	David James Ford, On the computation of the maximal order in a dedekind domain., 1978
	7	David Ford, The construction of maximal orders over a Dedekind domain, Journal of Symbolic Computation, v.4 n.1, p.69-75, August 1987 [doi>10.1016/S0747-7171(87)80054-8]
	8	C. Hollinger and P. Serf, SIMATH- a computer algebra system, in Proc. of the Colloquium on Comp. Number Theory, Debrecen, to appear.
	9	D.E.Knuth,The Art of Comp.Prog.,Addison-Wesley.
	10	N. Koblitz, "p-adic Numbers, ...', Springer Verlag.
	11	M. Pohst and H. Zassenhaus, "Algor. Algebr. Number Th.', Cambridge Univ. Press, 1989.
	12	E. Weis, "Alg. Number Th.', McGraw-Hill, 1963.
	13	H. Zassenhaus, On the Second Round, Appl. of Numb. Th. to Numerical Anal. (1972), pp 389-431.
	14	H. Zassenhaus, On Hensel Factorization II~ in Symposium on Algebraic Number Theory, Rome, 1973.
	15	H. Zassenhaus, On Structural Stability, Communications in Algebra 8 (1980), pp 1799-1844.