Sciweavers

73 search results - page 1 / 15
» On the Complexity of Solving a Bivariate Polynomial System
Sort
View
CORR
2011
Springer
186views Education» more  CORR 2011»
12 years 11 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
CASC
2005
Springer
113views Mathematics» more  CASC 2005»
13 years 10 months ago
Real Solving of Bivariate Polynomial Systems
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
Ioannis Z. Emiris, Elias P. Tsigaridas
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 4 months ago
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
Eric Berberich, Pavel Emeliyanenko, Michael Sagral...
ISSAC
2007
Springer
111views Mathematics» more  ISSAC 2007»
13 years 11 months ago
On the complexity of real solving bivariate systems
Dimitrios I. Diochnos, Ioannis Z. Emiris, Elias P....
CORR
2007
Springer
96views Education» more  CORR 2007»
13 years 4 months ago
New Complexity Bounds for Certain Real Fewnomial Zero Sets
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...
Joel Gomez, Andrew Niles, J. Maurice Rojas