default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 681
Volume 681, June 2017
- Jan Verschelde, Stephen M. Watt, Lihong Zhi:
TCS SNC Preface. 1-2
- Moulay A. Barkatou, Paola Boito
, Esteban Segura Ugalde:
A contour integral approach to the computation of invariant pairs. 3-26 - Dmitry Batenkov:
Accurate solution of near-colliding Prony systems via decimation and homotopy continuation. 27-40 - Mohamed Elkadi, André Galligo:
On mixed polynomials of bidegree (n, 1). 41-53 - Martin Helmer:
A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties. 54-74 - Yi Li:
Witness to non-termination of linear programs. 75-100 - Victor Y. Pan, Liang Zhao:
Real polynomial root-finding by means of matrix and polynomial iterations. 101-116 - Victor Y. Pan, Elias P. Tsigaridas:
Nearly optimal computations with structured matrices. 117-137 - Victor Y. Pan, Elias P. Tsigaridas:
Accelerated approximation of the complex roots and factors of a univariate polynomial. 138-145 - Dierk Schleicher, Robin Stoll:
Newton's method in practice: Finding all roots of polynomials of degree one million efficiently. 146-166 - Hiroshi Sekigawa:
The nearest polynomial to multiple given polynomials with a given zero in the real case. 167-175 - Konstantin Usevich, Ivan Markovsky:
Variable projection methods for approximate (greatest) common divisor computations. 176-198 - Wei-guo Wang, Yimin Wei:
Mixed and componentwise condition numbers for matrix decompositions. 199-216 - Wenyuan Wu, Greg Reid, Yong Feng:
Computing real witness points of positive dimensional polynomial systems. 217-231
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
