default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 2020: Kalamata, Greece
- Ioannis Z. Emiris, Lihong Zhi:
ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020. ACM 2020, ISBN 978-1-4503-7100-1 - David A. Cox:
Reflections on elimination theory. 1-4 - Alicia Dickenstein
:
Positive solutions of sparse polynomial systems. 5-7 - Lek-Heng Lim, Ke Ye:
Ubiquity of the exponent of matrix multiplication. 8-11 - Annie A. M. Cuyt:
What do sparse interpolation, padé approximation, gaussian quadrature and tensor decomposition have in common? 12 - Matthew England:
Real quantifier elimination by cylindrical algebraic decomposition, and improvements by machine learning. 13 - Simon Abelard, Alain Couvreur, Grégoire Lecerf:
Sub-quadratic time for riemann-roch spaces: case of smooth divisors over nodal plane projective curves. 14-21 - Mohammadali Asadi, Alexander Brandt, Robert H. C. Moir, Marc Moreno Maza, Yuzhen Xie:
On the parallelization of triangular decompositions. 22-29 - Anton Betten:
The orbiter ecosystem for combinatorial data. 30-37 - Stavros Birmpilis, George Labahn, Arne Storjohann:
A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix. 38-45 - Alin Bostan:
Computing the N-th term of a q-holonomic sequence. 46-53 - Manfred Buchacher, Manuel Kauers, Gleb Pogudin:
Separating variables in bivariate polynomial ideals. 54-61 - Jose Capco, Mohab Safey El Din, Josef Schicho:
Robots, computer algebra and eight connected components. 62-69 - Xavier Caruso, Tristan Vaccon, Thibaut Verron:
Signature-based algorithms for Gröbner bases over tate algebras. 70-77 - Hara Charalambous, Kostas Karagiannis, Sotiris Karanikolopoulos, Aristides Kontogeorgis:
Syzygies of ideals of polynomial rings over principal ideal domains. 78-82 - Cyrille Chenavier, Clemens Hofstadler, Clemens G. Raab, Georg Regensburger:
Compatible rewriting of noncommutative polynomials for proving operator identities. 83-90 - Shaoshi Chen, Lixin Du, Manuel Kauers, Thibaut Verron:
Integral bases for p-recursive sequences. 91-98 - Frédéric Chyzak, Philippe Dumas:
A Gröbner-basis theory for divide-and-conquer recurrences. 99-106 - Teresa Cortadellas, Carlos D'Andrea, M. Eulalia Montoro:
Bounds for degrees of minimal μ: bases of parametric surfaces. 107-113 - Xavier Dahan, Tristan Vaccon:
On a non-archimedean broyden method. 114-121 - Volker Diekert, Igor Potapov, Pavel Semukhin:
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. 122-129 - Michael DiPasquale, Zachary Flores, Chris Peterson:
On the apolar algebra of a product of linear forms. 130-137 - Mareike Dressler, Janin Heuer, Helen Naumann, Timo de Wolff:
Global optimization via the dual SONC cone and linear programming. 138-145 - Hao Du, Jing Guo, Ziming Li, Elaine Wong:
An additive decomposition in logarithmic towers and beyond. 146-153 - Timothy Duff, Michael Ruddy:
Numerical equality tests for rational maps and signatures of curves. 154-161 - Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
On fast multiplication of a matrix by its transpose. 162-169 - Jesse Elliott, Mark Giesbrecht, Éric Schost:
On the bit complexity of finding points in connected components of a smooth real hypersurface. 170-177 - Sebastian Falkensteiner, Cristhian Garay-López, Mercedes Haiech, Marc Paul Noordman, Zeinab Toghani, François Boulier:
The fundamental theorem of tropical partial differential algebraic geometry. 178-185 - Abhibhav Garg, Nitin Saxena:
Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree. 186-193 - Mark Giesbrecht, Qiao-Long Huang, Éric Schost:
Sparse multiplication for skew polynomials. 194-201 - Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
Essentially optimal sparse polynomial multiplication. 202-209 - Pascal Giorgi, Bruno Grenet, Daniel S. Roche:
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. 210-217 - Friedemann Groh:
Subdivisions for macaulay formulas of sparse systems. 218-225 - Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore:
On the uniqueness of simultaneous rational function reconstruction. 226-233 - Andrew Hone:
Efficient ECM factorization in parallel with the lyness map. 234-240 - Bo Huang:
Algorithmic averaging for studying periodic orbits of planar differential systems. 241-248 - Rémi Imbach, Victor Y. Pan:
New progress in univariate polynomial root finding. 249-256 - Yuki Ishihara, Tristan Vaccon, Kazuhiro Yokoyama:
On FGLM algorithms with tropical Gröbner bases. 257-264 - Yuki Ishihara:
Modular techniques for effective localization and double ideal quotient. 265-272 - Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos:
How many zeros of a random sparse polynomial are real? 273-280 - Christina Katsamaki, Fabrice Rouillier, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos:
On the geometry and the topology of parametric curves. 281-288 - George Kenison, Richard Lipton, Joël Ouaknine, James Worrell:
On the skolem problem and prime powers. 289-296 - Huu Phuoc Le, Mohab Safey El Din, Timo de Wolff:
Computing the real isolated points of an algebraic hypersurface. 297-304 - Viktor Levandovskyy, Hans Schönemann, Karim Abou Zeid:
Letterplace: a subsystem of singular for computations with free algebras via letterplace embedding. 305-311 - Viktor Levandovskyy, Tobias Metzlaff, Karim Abou Zeid:
Computation of free non-commutative gröbner bases over Z with Singular: Letterplace. 312-319 - Alexander Levin:
Some properties of multivariate differential dimension polynomials and their invariants. 320-327 - Dong Lu, Dingkang Wang, Fanghui Xiao:
Further results on the factorization and equivalence for multivariate polynomial matrices. 328-335 - Angelos Mantzaflaris, Bernard Mourrain, Ágnes Szántó:
Punctual Hilbert scheme and certified approximate singularities. 336-343 - Axel Mathieu-Mahias, Michaël Quisquater:
Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over FPr. 344-351 - Guillaume Melquiond, Raphaël Rieu-Helft:
WhyMP, a formally verified arbitrary-precision integer library. 352-359 - Alexei Miasnikov, Andrey Nikolaev:
On parameterized complexity of the word search problem in the Baumslag-Gersten group. 360-363 - Chenqi Mou:
On the chordality of ordinary differential triangular decomposition in top-down style. 364-371 - Kosaku Nagasaka:
Approximate GCD by bernstein basis, and its applications. 372-379 - Simone Naldi, Vincent Neiger:
A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension. 380-387 - Vincent Neiger, Johan Rosenkilde, Grigory Solomatov:
Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation. 388-395 - Rafael Oliveira:
Conditional lower bounds on the spectrahedral representation of explicit hyperbolicity cones. 396-401 - Erick Rodríguez Bazan, Evelyne Hubert:
Ideal Interpolation, H-bases and symmetry. 402-409 - Vikram Sharma:
Generalizing the davenport-mahler-mignotte bound. 410-417 - Frank Sottile:
General witness sets for numerical algebraic geometry. 418-425 - Hiroshi Teramoto, Katsusuke Nabeshima:
Parametric standard system for mixed module and its application to singularity theory. 426-433 - Josué Tonelli-Cueto, Elias P. Tsigaridas:
Condition numbers for the cube: i: Univariate polynomials and hypersurfaces. 434-441 - Dingkang Wang, Hesong Wang, Fanghui Xiao:
An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form. 442-449 - Jie Wang, Victor Magron:
A second order cone characterization for sums of nonnegative circuits. 450-457 - Zhonggang Zeng:
Geometric modeling and regularization of algebraic problems. 458-465
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 2026-05-17 00:00 CEST 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:
