80 search results - page 5 / 16 » On the Complexity of Real Root Isolation |
ISSAC
2009
Springer
15 years 7 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coeļ¬cients) can be done in time polynomial in the sparse encoding for any ļ¬...
106
click to vote
ISSAC
1998
Springer
15 years 5 months ago
1998
Springer
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...
138
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The ļ¬rst step in isolating a bug involves identifying a sequence of step...
210
click to vote
ASPLOS
2009
ACM
16 years 1 months ago
2009
ACM
Software defects, commonly known as bugs, present a serious challenge for system reliability and dependability. Once a program failure is observed, the debugging activities to loc...
CORR
2007
Springer
15 years 1 months ago
2007
Springer
d Abstract) Frederic Bihanā Joel Gomezā Andrew Nilesā” J. Maurice RojasĀ§ January 24, 2007 Rojas dedicates this paper to his friend, Professor Tien-Yien Li. Consider real biv...