Finding exact minimal polynomial by approximations

doi:10.1145/1577190.1577211

Finding exact minimal polynomial by approximations

Full Text:

Pdf

Buy this Article

Authors:	Xiaolin Qin	Chinese Academy of Sciences, Chengdu, China
	Yong Feng	Chinese Academy of Sciences and University of Electronic Science and Technology of China, Chengdu, China
	Jingwei Chen	Chinese Academy of Sciences, Chengdu, China
	Jingzhong Zhang	Chinese Academy of Sciences and University of Electronic Science and Technology of China, Chengdu, China

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 12 · Citation Count: 0

Published in:

	· Proceeding
	SNC '09 Proceedings of the 2009 conference on Symbolic numeric computation
	ACM New York, NY, USA ©2009 table of contents ISBN: 978-1-60558-664-9 doi>10.1145/1577190.1577211

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Tags: algebraic algorithms algebraic number algorithms computations on polynomials experimentation integer relation algorithm minimal polynomial numerical approximate computation symbolic-numerical computation

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player