default search action
ISSAC 2023: Tromsø, Norway
- Alicia Dickenstein, Elias P. Tsigaridas, Gabriela Jeronimo:
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023. ACM 2023
Session 1: Invited Talks
- Nikhil Srivastava
:
The Complexity of Diagonalization. 1-6 - Rekha R. Thomas
Two Views of ℙ3. 7-12 - Frank Vallentin
Least distortion Euclidean embeddings of flat tori. 13-23
Session 2: Tutorial Talks
- Paola Boito
Matrix Structures and Matrix Functions. 24-30 - Irina A. Kogan
Invariants: Computation and Applications. 31-40 - Laura Kovács
Algebra-Based Loop Analysis. 41-42
Session 3: Contributed Papers
- Marianne Akian
The Tropical Nullstellensatz and Positivstellensatz for Sparse Polynomial Systems. 43-52 - Yulia Alexandr
Moment Varieties for Mixtures of Products. 53-60 - Saúl A. Blanco
An Algorithm to Enumerate Grid Signed Permutation Classes. 61-69 - Alin Bostan
Beating binary powering for polynomial matrices. 70-79 - Alin Bostan
Fast Algorithms for Discrete Differential Equations. 80-89 - Florent Bréhard
Validated Root Enclosures for Interval Polynomials with Multiplicities. 90-99 - Dominic Bunnett
Generalised cone complexes and tropical moduli in polymake. 100-106 - Peter Bürgisser
Real zeros of mixed random fewnomial systems. 107-115 - Michael A. Burr, Michael Byrd:
Certified simultaneous isotopic approximation of pairs of curves via subdivision. 116-125 - Michael A. Burr
Isolating clusters of zeros of analytic systems using arbitrary-degree inflation. 126-134 - Sayak Chakrabarti
An effective description of the roots of bivariates mod pk and the related Igusa's local zeta function. 135-144 - Rizeng Chen
Deciding first-order formulas involving univariate mixed trigonometric-polynomials. 145-154 - Shaoshi Chen
Hermite Reduction for D-finite Functions via Integral Bases. 155-163 - Shaoshi Chen
Stability Problems on D-finite Functions. 164-172 - Tian Chen
A New Black Box Factorization Algorithm - the Non-monic Case. 173-181 - Thomas Cluzeau
Further results on the computation of the annihilators of integro-differential operators. 182-190 - Thierry Combot
Hyperelliptic Integrals to Elliptic Integrals. 191-198 - Robert M. Corless
Blendstrings: an environment for computing with smooth functions. 199-207 - Xavier Dahan
Chinese Remainder Theorem for bivariate lexicographic Gröbner bases. 208-217 - James Harold Davenport
Lazard-style CAD and Equational Constraints. 218-226 - Jose Divasón
Sensitivity analysis of discrete preference functions using Koszul simplicial complexes. 227-235 - Ruiwen Dong
Termination of linear loops under commutative updates. 236-241 - Hao Du
Computing Logarithmic Parts by Evaluation Homomorphisms✱. 242-250 - Timothy Duff
Using monodromy to recover symmetries of polynomial systems. 251-259 - Christian Eder
A Direttissimo Algorithm for Equidimensional Decomposition. 260-269 - Sriram Gopalakrishnan
Refined F5 Algorithms for Ideals of Minors of Square Matrices. 270-279 - Sander Gribling
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. 280-288 - Tor Hadas
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation. 289-297 - Clemens Hofstadler
Signature Gröbner bases in free algebras over rings. 298-306 - Bo Huang
Using Symbolic Computation to Analyze Zero-Hopf Bifurcations of Polynomial Differential Systems. 307-314 - Qiao-Long Huang
New Sparse Multivariate Polynomial Factorization Algorithms over Integers. 315-324 - Rémi Imbach
Fast evaluation and root finding for polynomials with floating-point coefficients. 325-334 - Riccardo Invernizzi
Multiplication polynomials for elliptic curves over finite local rings. 335-344 - Md. Nazrul Islam
Algorithm for Connectivity Queries on Real Algebraic Curves. 345-353 - Gorav Jindal
On the Order of Power Series and the Sum of Square Roots Problem. 354-362 - Christina Katsamaki
On Isolating Roots in a Multiple Field Extension. 363-371 - Manuel Kauers
Transcendence Certificates for D-finite Functions. 372-380 - Manuel Kauers
Flip Graphs for Matrix Multiplication. 381-388 - Manuel Kauers
Order bounds for C2-finite sequences. 389-397 - George Kenison
From Polynomial Invariants to Linear Loops. 398-406 - George Kenison
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. 407-416 - Przemyslaw Koprowski
Factorization and root-finding for polynomials over division quaternion algebras. 417-424 - Przemyslaw Koprowski
Pourchet's theorem in action: decomposing univariate nonnegative polynomials as sums of five squares. 425-433 - Christoph Koutschan
A Unified Approach to Unimodality of Gaussian Polynomials. 434-442 - Adam Kurpisz
Sum of Squares Bounds for the Empty Integral Hull Problem. 443-451 - George Labahn
Faster real root decision algorithm for symmetric polynomials. 452-460 - Yossef Musleh
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology. 461-469 - Kosaku Nagasaka
SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials. 470-479 - Clément Pernet
Exact computations with quasiseparable matrices. 480-489 - Aditya Ravi
New Characterization of the Factor Refinement Algorithm with Applications. 490-497 - Carsten Schneider
Refined telescoping algorithms in RΠΣ -extensions to reduce the degrees of the denominators✱. 498-507 - Éric Schost
p-adic algorithm for bivariate Gröbner bases. 508-516 - Tristan Vaccon
Universal Analytic Gröbner Bases and Tropical Geometry. 517-525 - Gilles Villard
Elimination ideal and bivariate resultant over finite fields. 526-534 - Stephen Michael Watt
Efficient Generic Quotients Using Exact Arithmetic. 535-544 - Sizhuo Yan
A Characterization of Perfect Strategies for Mirror Games. 545-554
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-07-15 20:36 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: