skip to main content
column

Calculating approximate GCD of multiple univariate polynomials using approximate syzygies

Published: 28 January 2014 Publication History

Abstract

No abstract available.

References

[1]
Z. Li, Z. Yang, and L. Zhi. Blind image deconvolution via fast approximate GCD. In Proceedings of ISSAC '10, pages 155--162, 2010.
[2]
D. Rupprecht. An algorithm for computing certified approximate GCD of n univariate polynomials. J. Pure Appl. Algebra, 139:255--284, 1999.
[3]
A. Terui. GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials. In Lecture Notes in Computer Science 6244, pages 238--249. Springer, 2010.
[4]
A. Terui. GPGCD: An iterative method for calculating approximate GCD of univariate polynomials. Theoretical Computer Science, 479:127--149, 2013. Symbolic-Numerical Algorithms.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Communications in Computer Algebra
ACM Communications in Computer Algebra  Volume 47, Issue 3/4
September/December 2013
116 pages
ISSN:1932-2232
EISSN:1932-2240
DOI:10.1145/2576802
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 January 2014
Published in SIGSAM-CCA Volume 47, Issue 3/4

Check for updates

Qualifiers

  • Column

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 36
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media