Deciding linear disjointness of finitely generated fields

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Deciding linear disjointness of finitely generated fields

Full text

Pdf (293 KB)

Source

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

Rostock, Germany

Pages: 153 - 160

Year of Publication: 1998

ISBN:1-58113-002-3

Authors

Jörn Müller-Quade	Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, Germany
Martin Rötteler	Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, Germany

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 8, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

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/281508.281599 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	BECKER, T., AND WEISPFENNING, V. GrSbner Bases: A Computational Approach to Commutative Algebra. In cooperation with Heinz Kredel. Graduate Texts in Mathematics. Springer, New York, 1993.
	2	BETH, T., GRASSL, M., AND M/~LLER-QUADE, J. AI- gebra for Optical Computing and Quantum Computing. In The 2nd IMA CS Conference on Applications of Computer Algebra (RISC Hagenberg Osterreich, July 1996). The proceedings contain abstracts only.
	3	B/~RGISSER, P., CLAUSEN, M., AND SHOKROLLAHI, A. Algebraic Complexity Theory. No. 315 in Grundlehren der mathematischen Wissenschaften. Springer Verlag, 1997.
	4	EISENBUD, D. Commutative Algebra with a View Toward Algebraic Geometry. Graduate Texts in Mathematics. Springer, New York, 1995.
	5	KEMPER, G. An Algorithm to Determine Properties of Field Extensions Lying over a Ground Field. IWR Preprint 93-58, Heidelberg, Oktober 1993. This paper is also contained in Gregor Kempers fields package for Maple.
	6	LANG, S. Algebra, 2 ed. Addison-Wesley, 1984.
	7	M{ILLER-QUADE, J., AND STEINWANDT, R. Basic AI- gorithms for Rational Function Fields. E.I.S.S.-Report 97-2 . E.I.S.S., Universit/it Karlsruhe, 1996.
	8	M/~LLER-QUADE, J., STEINWANDT, R., AND BETH, T. An application of GrSbner bases to the decomposition of rational mappings. In GrSbner Bases and Applications (Proc. of the Conference 33 Years of GrSbner Bases) (1998), B. Buchberger and F. Winkler, Eds., vol. 251 of London Mathematical Society Lecture Notes Series, Cambridge University Press.
	9	David Shannon , Moss Sweedler, Using Gro¨bner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence, Journal of Symbolic Computation, v.6 n.2-3, p.267-273, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80047-6]
	10	Moss Sweedler, Using Groebner Bases to Determine the Algebraic and Transcendental Nature of Field Extensions: Return of the Killer Tag Variables, Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.66-75, May 10-14, 1993