Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Approximate GCD by relaxed NewtonSLRA algorithm

From MaRDI portal
Publication:5102006
Jump to:navigation, search

DOI10.1145/3511528.3511536OpenAlexW4205210219WikidataQ130926581 ScholiaQ130926581MaRDI QIDQ5102006

Kosaku Nagasaka

Publication date: 6 September 2022

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3511528.3511536



Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)








This page was built for publication: Approximate GCD by relaxed NewtonSLRA algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5102006&oldid=19615202"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 13:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki