Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
issac 1998
Sort
relevance
views
votes
recent
update
View
thumb
title
126
Voted
ISSAC
1998
Springer
101
views
Mathematics
»
more
ISSAC 1998
»
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
15 years 7 months ago
Download
www4.ncsu.edu
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »