default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 2021: Virtual Event, Russia
- Frédéric Chyzak, George Labahn:
ISSAC '21: International Symposium on Symbolic and Algebraic Computation, Virtual Event, Russia, July 18-23, 2021. ACM 2021, ISBN 978-1-4503-8382-0
Invited Talks
- Alin Bostan:
Computer Algebra in the Service of Enumerative Combinatorics. 1-8 - Xiao-Shan Gao:
New Developments of Mathematics Mechanization. 9
Tutorials
- Janko Böhm, Anne Frühbis-Krüger
:
Massively Parallel Computations in Algebraic Geometry. 11-14 - Marc Moreno Maza:
Design and Implementation of Multi-Threaded Algorithms in Polynomial Algebra. 15-20 - Pierre Vanhove:
Differential Equations for Feynman Integrals. 21-26
Contributed Papers
- Jakob Ablinger, Carsten Schneider:
Solving Linear Difference Equations with Coefficients in Rings with Idempotent Representations. 27-34 - Nikhil Balaji, Sylvain Perifel, Mahsa Shirmohammadi, James Worrell:
Cyclotomic Identity Testing and Applications. 35-42 - Lorenzo Baldi, Bernard Mourrain:
Computing Real Radicals by Moment Optimization. 43-50 - Jérémy Berthomieu, Christian Eder, Mohab Safey El Din:
msolve: A Library for Solving Polynomial Systems. 51-58 - David Braun, Nicolas Magaud, Pascal Schreck:
Two New Ways to Formally Prove Dandelin-Gallucci's Theorem. 59-66 - Xavier Caruso, Tristan Vaccon, Thibaut Verron:
On FGLM Algorithms with Tate Algebras. 67-74 - Shaoshi Chen, Lixin Du, Manuel Kauers:
Lazy Hermite Reduction and Creative Telescoping for Algebraic Functions. 75-82 - Shaoshi Chen, Ruyong Feng, Pingchuan Ma, Michael F. Singer:
Separability Problems in Creative Telescoping. 83-90 - Andrey T. Cherkasov, Dmitri Piontkovski:
Wilf Classes of Non-symmetric Operads. 91-98 - Thierry Combot:
Elementary Integration of Superelliptic Integrals. 99-106 - Robert M. Corless, Leili Rafiee Sevyeri, B. David Saunders:
Equivalences for Linearizations of Matrix Polynomials. 107-114 - Mawunyo Kofi Darkey-Mensah, Przemyslaw Koprowski, Beata Rothkegel:
The Anisotropic Part of a Quadratic Form over a Global Function Field. 115-122 - Rina Dong, Dong Lu, Chenqi Mou, Dongming Wang:
Comprehensive Characteristic Decomposition of Parametric Polynomial Systems. 123-130 - Elie Eid:
Fast Computation of Hyperelliptic Curve Isogenies in Odd Characteristic. 131-138 - Maria Francis, Thibaut Verron:
On Two Signature Variants of Buchberger's Algorithm over Principal Ideal Domains. 139-146 - Ryoya Fukasaku:
Criteria for Hopf Bifurcations with Fixed Multiplicities. 147-154 - Mark Giesbrecht, Qiao-Long Huang, Éric Schost:
Sparse Multiplication of Multivariate Linear Differential Operators. 155-162 - Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
On Exact Division and Divisibility Testing for Sparse Polynomials. 163-170 - Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore:
Polynomial Linear System Solving with Random Errors: New Bounds and Early Termination Technique. 171-178 - Joris van der Hoeven, Grégoire Lecerf:
Amortized Bivariate Multi-point Evaluation. 179-185 - Joris van der Hoeven, Gleb Pogudin:
A Zero Test for σ-algebraic Power Series. 187-192 - Kai Hormann, Lucas Kania, Chee Yap:
Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation with Application to Real Root Isolation. 193-200 - Seung Gyu Hyun, Vincent Neiger, Éric Schost:
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials. 201-208 - Antonio Jiménez-Pastor:
Simple Differentially Definable Functions. 209-216 - Antonio Jiménez-Pastor, Philipp Nuspl, Veronika Pillwein:
On C2-finite Sequences. 217-224 - Fredrik Johansson:
Calcium: Computing in Exact Real and Complex Fields. 225-232 - Erich L. Kaltofen:
Computing Higher Polynomial Discriminants. 233-239 - Erich L. Kaltofen, Clément Pernet, Zhi-Hong Yang:
Hermite Interpolation With Error Correction: Fields of Zero or Large Characteristic and Large Error Rate. 241-247 - Pierre Karpman, Clément Pernet, Hippolyte Signargout, Gilles Villard:
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices. 249-256 - Pierre Lairez, Mohab Safey El Din:
Computing the Dimension of Real Algebraic Sets. 257-264 - Huu Phuoc Le, Mohab Safey El Din:
Faster One Block Quantifier Elimination for Regular Polynomial Systems of Equations. 265-272 - Alexander Levin:
Generalized Gröbner Bases and New Properties of Multivariate Difference Dimension Polynomials. 273-280 - Haokun Li, Bican Xia, Huiying Zhang, Tao Zheng:
Choosing the Variable Ordering for Cylindrical Algebraic Decomposition via Exploiting Chordal Structure. 281-288 - Jianwei Li:
On the Smallest Ratio Problem of Lattice Bases. 289-296 - Ngoc Hoang Anh Mai, Abhishek Bhardwaj, Victor Magron:
The Constant Trace Property in Noncommutative Optimization. 297-304 - Philippe Malbos, Isaac Ren:
Completion in Operads via Essential Syzygies. 305-312 - Jasper Nalbach, Erika Ábrahám, Gereon Kremer:
Extending the Fundamental Theorem of Linear Programming for Strict Inequalities. 313-320 - Taihei Oki:
Computing Valuations of the Dieudonné Determinants. 321-328 - Raphaël Pagès:
Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time. 329-336 - J. Maurice Rojas, Yuyu Zhu:
A Complexity Chasm for Solving Univariate Sparse Polynomial Equations Over p-adic Fields. 337-344 - Alexandre Sedoglavic, Alexey V. Smirnov:
The Tensor Rank of 5x5 Matrices Multiplication is Bounded by 98 andIts Border Rank by 89. 345-351 - Mikhail R. Starchak:
Positive Existential Definability with Unit, Addition and Coprimeness. 353-360 - Shinichi Tajima, Katsusuke Nabeshima:
Computing Grothendieck Point Residues via Solving Holonomic Systems of First Order Partial Differential Equations. 361-368
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 2024-09-25 00:31 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:
