Sciweavers

619 search results - page 27 / 124
» Generic Extensions and Generic Polynomials
Sort
View
84
Voted
COMBINATORICA
2007
56views more  COMBINATORICA 2007»
15 years 3 months ago
On embeddability and stresses of graphs
Gluck [6] has proven that triangulated 2-spheres are generically 3-rigid. Equivalently, planar graphs are generically 3-stress free. We show that already the K5-minor freeness gua...
Eran Nevo
112
Voted
ISSAC
2007
Springer
93views Mathematics» more  ISSAC 2007»
15 years 9 months ago
Approximate bivariate factorization: a geometric viewpoint
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in   [x, y]. Given a composite polyno...
André Galligo, Mark van Hoeij
140
Voted
MP
2010
172views more  MP 2010»
15 years 1 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
104
Voted
CORR
2010
Springer
159views Education» more  CORR 2010»
15 years 3 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...
169
Voted
TCS
2011
14 years 10 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski