ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A subresultant theory for multivariate polynomials
Full text PdfPdf (515 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: 79 - 85  
Year of Publication: 1991
ISBN:0-89791-437-6
Author
Laureano González-Vega  Departamento de Matemáticas, Estadística y Computación, Facultad de Ciencias, Universidad de Cantabria, Santander 39071, Spain
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): 15,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120705
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.

 
GLRR
L. Gonzalez Vega, H. Lombardi, T. Recio, M.- F. Roy: Specialisation de la suite de Sturm et sousresultants (I et II). I: Informatique Theorique et Applications 24, 6, 561-588(1990).II: To appear in Informatique Theorique et Applications
 
GV
L. Gonzalez Vega: A Determinantal Formulae for the Solution Set of Zero-Dimensional Ideals. To appear in the J. of Pure and Applied Algebra (1990).
 
Hab
V. W. Habicht: Zur inhomogenen ehminationstheorie. Comm. Math. Helvetici 21, 79-98 (1948).
 
Ho
Chung-Jen Ho , Chee Keng Yap, Topics in algebraic computing: subresultants, gcd, factoring and primary ideal decomposition, 1989
 
Loos
R. Loos: Generalized polynomial remainder sequences. Computer Algebra, ed. B. Buchberger, G.E. Collins and R. Loos, 115-138. Computing Suplementum 4, Springer Verlag, NY (1982).
 
Mac
F. S. Macaulay: Some formulae in elimination. Proc. London Math. Sot. (1) 35, 3-27 (1902).
 
VW
B. L. van der Waerden: Modern Algebra II. Third edition. F. Ungar Publishing Co., NY (1950).

CITED BY  2
Agnes Szanto, Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin), Journal of Symbolic Computation, v.43 n.1, p.46-74, January, 2008
Koji Ouchi , John Keyser, Rational Univariate Reduction via toric resultants, Journal of Symbolic Computation, v.43 n.11, p.811-844, November, 2008

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
      I.1.2 Algorithms
          Subjects: Algebraic algorithms

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Computations on polynomials


General Terms:
Algorithms, Theory

Collaborative Colleagues:
Laureano González-Vega: colleagues

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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player