default search action
ISSAC 2022: Villeneuve-d'Ascq, France
- Marc Moreno Maza, Lihong Zhi:
ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022. ACM 2022, ISBN 978-1-4503-8688-3
Session 1: Invited Talks
- Mioara Joldes:
Validated Numerics: Algorithms and Practical Applications in Aerospace. 1-2 - Joris van der Hoeven
:
On the Complexity of Symbolic Computation. 3-12 - Avi Wigderson:
Non-commutative Optimization - Where Algebra, Analysis and Computational Complexity Meet. 13-19
Session 2: Tutorial Talks
- Matías R. Bender:
Solving Sparse Polynomial Systems using Gröbner Bases and Resultants. 21-30 - Aydin Buluç:
Sparse Matrices Powering Three Pillars of Science: Simulation, Data, and Learning. 31 - Nathalie Verdière, Sébastien Orange:
Applications of Computer Algebra to Parameter Analysis of Dynamical Systems. 33-38
Session 3: Differential and Difference Algebra
- Sergei A. Abramov, Marko Petkovsek, Anna A. Ryabenko:
On Linear Dependence of Rows and Columns in Matrices over Non-commutative Domains. 39-43 - Philipp Nuspl, Veronika Pillwein:
Simple C2-finite Sequences: a Computable Generalization of C-finite Sequences. 45-53 - Alexander Levin:
Reduction with Respect to the Effective Order and a New Type of Dimension Polynomials of Difference Modules. 55-62 - Sebastian Falkensteiner
Puiseux Series Solutions with Real or Rational Coefficients of First Order Autonomous AODEs. 63-71 - Frédéric Chyzak, Alexandre Goyer, Marc Mezzarobba:
Symbolic-Numeric Factorization of Differential Operators. 73-82 - Manuel Kauers, Christoph Koutschan
Guessing with Little Data. 83-90 - Hui Huang, Manuel Kauers, Gargi Mukherjee:
Order-Degree-Height Surfaces for Linear Operators. 91-99 - Alin Bostan, Frédéric Chyzak, Hadrien Notarantonio, Mohab Safey El Din:
Algorithms for Discrete Differential Equations of Order 1. 101-110 - Yi Zhou, Mark van Hoeij:
Desingularization and p-Curvature of Recurrence Operators. 111-118 - Dmitrii Pavlov
On Realizing Differential-Algebraic Equations by Rational Dynamical Systems. 119-128
Session 4: Algorithms and Complexity
- Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell:
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. 129-138 - Alperen Ali Ergür
Beyond Worst-Case Analysis for Root Isolation Algorithms. 139-148 - Adrien Poteaux, Martin Weimann:
Local Polynomial Factorisation: Improving the Montes Algorithm. 149-157 - Michael B. Monagan, Garrett Paluck:
Linear Hensel Lifting for Zp[x, y] for n Factors with Cubic Cost. 159-166 - Thi Xuan Vu:
Computing Critical Points for Algebraic Systems Defined by Hyperoctahedral Invariant Polynomials. 167-175 - Erich L. Kaltofen:
The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds. 177-186 - Barbara Giunti
Average Complexity of Matrix Reduction for Clique Filtrations. 187-196 - François Morain:
Implementing the Thull-Yap Algorithm for Computing Euclidean Remainder Sequences. 197-205 - Pascal Giorgi, Bruno Grenet
Random Primes without Primality Testing. 207-215
Session 5: Polynomials Systems
- Dingkang Wang, Jingjing Wei, Fanghui Xiao, Xiaopeng Zheng:
Rational Univariate Representation of Zero-Dimensional Ideals with Parameters. 217-224 - Hiroshi Kera:
Border Basis Computation with Gradient-Weighted Normalization. 225-234 - Péter Kutas, Mickaël Montessinos
Finding Nontrivial Zeros of Quadratic Forms over Rational Function Fields of Characteristic 2. 235-244 - André Galligo:
Modeling Complex Root Motion of Real Random Polynomials under Differentiation. 245-253 - Evangelos Bartzos, Ioannis Z. Emiris, Ilias S. Kotsireas, Charalambos Tzamos
Bounding the Number of Roots of Multi-Homogeneous Systems. 255-262
Session 6: Computational Algebraic Geometry
- Tobias Boege
Marginal Independence Models. 263-271 - Apostolos Chalkis, Christina Katsamaki, Josué Tonelli-Cueto:
On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves. 273-282 - Carles Checa, Ioannis Z. Emiris:
A Greedy Approach to the Canny-Emiris Formula. 283-291
Session 7: Lattices and Graphs
- Michael Figelius, Markus Lohrey:
Exponent Equations in HNN-extensions. 293-301 - Haomin Li, Arne Storjohann:
Computing a Basis for an Integer Lattice: A Special Case. 303-310 - Viktor Levandovskyy, Christian Eder, Andreas Steenpass, Simon Schmidt, Julien Schanz, Moritz Weber:
Existence of Quantum Symmetries for Graphs on Up to Seven Vertices: A Computer based Approach. 311-318
Session 8: Optimization
- Przemyslaw Koprowski
Solving Sums of Squares in Global Fields. 319-324 - Victor Magron, Mohab Safey El Din, Markus Schweighofer, Trung Hieu Vu
Exact SOHS Decompositions of Trigonometric Univariate Polynomials with Gaussian Coefficients. 325-332 - Yuan Chang, Jesús A. De Loera, William J. Wesley
Rado Numbers and SAT Computations. 333-342
Session 9: Linear Algebra and Polynomial Matrices
- Dong Lu, Dingkang Wang, Fanghui Xiao, Xiaopeng Zheng:
A Property of Modules Over a Polynomial Ring With an Application in Multivariate Polynomial Matrix Factorizations. 343-350 - George Labahn, Vincent Neiger, Thi Xuan Vu, Wei Zhou:
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. 351-360 - Robert M. Corless, George Labahn, Dan Piponi, Leili Rafiee Sevyeri:
Bohemian Matrix Geometry. 361-370
Session 10: Algorithmic Number Theory
- Cheng-Chao Huang:
Explicit Bounds for Linear Forms in the Exponentials of Algebraic Numbers. 371-379 - Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Rational Parameters. 381-389 - Reinhold Burger:
Enumerating Denumerable Sets in Polynomial Time via the Schröder-Bernstein Theorem. 391-398
Session 11: Gröbner Bases
- Andrew Ferguson, Huu Phuoc Le:
Finer Complexity Estimates for the Change of Ordering of Gröbner Bases for Generic Symmetric Determinantal Ideals. 399-407 - Jérémy Berthomieu, Vincent Neiger, Mohab Safey El Din:
Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions. 409-418 - Michela Ceria, Ferdinando Mora:
A Degroebnerization Approach to Algebraic Statistics. 419-428
Session 12: Real Algebraic Geometry
- Weifeng Shang, Chenqi Mou, Deepak Kapur:
Algorithms for Testing Membership in Univariate Quadratic Modules over the Reals. 429-437 - Damien Chablat
Deciding Cuspidality of Manipulators through Computer Algebra and Algorithms in Real Algebraic Geometry. 439-448 - Nuwan Herath Mudiyanselage, Guillaume Moroz, Marc Pouget:
Fast High-Resolution Drawing of Algebraic Curves. 449-458
Session 13: Sparse Polynomial Interpolation
- Pascal Giorgi, Bruno Grenet
Sparse Polynomial Interpolation and Division in Soft-linear Time. 459-468 - Erich L. Kaltofen:
Sparse Polynomial Hermite Interpolation. 469-478
Session 14: Commutative Algebra and Algebraic Geometry
- Yuki Ishihara:
Modular Techniques for Intermediate Primary Decomposition. 479-487 - Xavier Caruso, Tristan Vaccon, Thibaut Verron
On Polynomial Ideals and Overconvergence in Tate Algebras. 489-497
Session 15: Differential Systems in Applications
- François Ollivier:
Extending Flat Motion Planning to Non-flat Systems. Experiments on Aircraft Models Using Maple. 499-507 - Rodrigo Iglesias
An Algebraic Version of the Sum-of-disjoint-products Method for Multi-state System Reliability Analysis. 509-516
Session 16: Symbolic Integration and Summation
- Shaoshi Chen:
Stability Problems in Symbolic Integration. 517-524 - Carlos E. Arreche
Mahler Discrete Residues and Summability for Rational Functions. 525-533
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-11-21 20:16 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: