Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Approximate contact factorization of germs of plane curves
by
van der Hoeven, Joris
, Lecerf, Grégoire
in
Computer Science
/ Mathematical Software
2024
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Approximate contact factorization of germs of plane curves
by
van der Hoeven, Joris
, Lecerf, Grégoire
in
Computer Science
/ Mathematical Software
2024
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Approximate contact factorization of germs of plane curves
Journal Article
Approximate contact factorization of germs of plane curves
2024
Request Book From Autostore
and Choose the Collection Method
Overview
Given an algebraic germ of a plane curve at the origin, in terms of a bivariate polynomial, we analyze the complexity of computing an irreducible decomposition up to any given truncation order. With a suitable representation of the irreducible components, and whenever the characteristic of the ground field is zero or larger than the degree of the germ, we design a new algorithm that involves a nearly linear number of arithmetic operations in the ground field plus a small amount of irreducible univariate polynomial factorizations.
Publisher
Springer Verlag
Subject
This website uses cookies to ensure you get the best experience on our website.