Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 2018: New York, NY, USA
- Manuel Kauers, Alexey Ovchinnikov, Éric Schost:
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018. ACM 2018
Invited Talks
- Micha Sharir:
Algebraic Techniques in Geometry: The 10th Anniversary. 1-5 - Andrew J. Sommese:
Polynomial Systems Arising From Discretizing Systems of Nonlinear Differential Equations. 7-9 - Thomas Sturm:
Thirty Years of Virtual Substitution: Foundations, Techniques, Applications. 11-16
Tutorials
- Shivkumar Chandrasekaran, Nithin Govindarajan
, Abhejit Rajagopal:
Fast Algorithms for Displacement and Low-Rank Structured Matrices. 17-22 - Stephen A. Linton:
GAP 4 at Twenty-one - Algorithms, System Design and Applications. 23-24 - Daniel S. Roche:
What Can (and Can't) we Do with Sparse Polynomials? 25-30
Contributed Papers
- Toru Aoyama, Masayuki Noro:
Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals. 31-38 - Moulay A. Barkatou, Maximilian Jaroschek:
Desingularization of First Order Linear Difference Systems with Rational Function Coefficients. 39-46 - Moulay A. Barkatou, Joelle Saadé, Jacques-Arthur Weil:
A New Approach for Formal Reduction of Singular Linear Differential Systems Using Eigenrings. 47-54 - Evangelos Bartzos, Ioannis Z. Emiris, Jan Legerský, Elias P. Tsigaridas:
On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs. 55-62 - Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris, Elias P. Tsigaridas:
Bilinear Systems with Two Supports: Koszul Resultant Matrices, Eigenvalues, and Eigenvectors. 63-70 - Matías R. Bender, Jean-Charles Faugère, Elias P. Tsigaridas:
Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case. 71-78 - Jérémy Berthomieu, Jean-Charles Faugère:
A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations. 79-86 - Nathan Bliss, Timothy Duff, Anton Leykin, Jeff Sommars:
Monodromy Solver: Sequential and Parallel. 87-94 - Alin Bostan, Frédéric Chyzak, Pierre Lairez, Bruno Salvy:
Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions. 95-102 - Florent Bréhard:
A Newton-like Validation Method for Chebyshev Approximate Solutions of Linear Ordinary Differential Systems. 103-110 - Curtis Bright, Ilias S. Kotsireas, Albert Heinle, Vijay Ganesh:
Enumeration of Complex Golay Pairs via Programmatic SAT. 111-118 - Xavier Caruso, David Roe, Tristan Vaccon:
ZpL: a p-adic Precision Package. 119-126 - Jingwei Chen, Damien Stehlé, Gilles Villard:
Computing an LLL-reduced Basis of the Orthogonal Latice. 127-133 - Shaoshi Chen, Hao Du, Ziming Li:
Additive Decompositions in Primitive Extensions. 135-142 - Thierry Combot, Camilo Sanabria:
A Symplectic Kovacic's Algorithm in Dimension 4. 143-150 - Jean-Guillaume Dumas, Clément Pernet:
Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix. 151-158 - Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing Nearby Non-trivial Smith Forms. 159-166 - Pascal Giorgi, Vincent Neiger:
Certification of Minimal Approximant Bases. 167-174 - José Gómez-Torrecillas, Francisco Javier Lobillo, Gabriel Navarro:
Computing Free Distances of Idempotent Convolutional Codes. 175-182 - Andrea Guidolin, Ana Romero:
Effective Computation of Generalized Spectral Sequences. 183-190 - Didier Henrion, Simone Naldi, Mohab Safey El Din:
Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set. 191-198 - Joris van der Hoeven, Robin Larrieu:
Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases. 199-206 - Johannes Hoffmann, Viktor Levandovskyy:
Constructive Arithmetics in Ore Localizations with Enough Commutativity. 207-214 - Alexander Hulpke:
Constructive Membership Tests in Some Infinite Matrix Groups. 215-222 - Erdal Imamoglu, Erich L. Kaltofen, Zhengfeng Yang:
Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases. 223-230 - Antonio Jiménez-Pastor, Veronika Pillwein:
Algorithmic Arithmetics with DD-Finite Functions. 231-237 - Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang:
An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD. 239-246 - Avinash Kulkarni, Yue Ren, Mahsa Sayyary Namin, Bernd Sturmfels:
Real Space Sextics and their Tritangents. 247-254 - Alexander B. Levin:
Bivariate Dimension Polynomials of Non-Reflexive Prime Difference-Differential Ideals.: The Case of One Translation. 255-262 - Wen-Ding Li, Ming-Shing Chen, Po-Chun Kuo, Chen-Mou Cheng, Bo-Yin Yang:
Frobenius Additive Fast Fourier Transform. 263-270 - Dong Lu, Dingkang Wang, Fanghui Xiao, Jie Zhou:
Extending the GVW Algorithm to Local Ring. 271-278 - Victor Magron, Mohab Safey El Din:
On Exact Polya and Putinar's Representations. 279-286 - Chenqi Mou, Yang Bai:
On the Chordality of Polynomial Sets in Triangular Decomposition in Top-Down Style. 287-294 - Vincent Neiger, Johan Rosenkilde, Grigory Solomatov:
Computing Popov and Hermite Forms of Rectangular Polynomial Matrices. 295-302 - Ignacio García-Marco, Pascal Koiran, Timothée Pecatte:
Polynomial Equivalence Problems for Sum of Affine Powers. 303-310 - Gleb Pogudin, Ágnes Szántó:
Irredundant Triangular Decomposition. 311-318 - Maria J. de la Puente, Pedro L. Claveria:
Volume of Alcoved Polyhedra and Mahler Conjecture. 319-326 - Tomás Recio, J. Rafael Sendra, Carlos Villarino:
The Importance of Being Zero. 327-333 - Cordian Riener, Mohab Safey El Din:
Real Root Finding for Equivariant Semi-algebraic Systems. 335-342 - Daniel S. Roche:
Error Correction in Fast Matrix Multiplication and Inverse. 343-350 - Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi:
On the Complexity of Computing Real Radicals of Polynomial Systems. 351-358 - Yosuke Sato, Ryoya Fukasaku, Hiroshi Sekigawa:
On Continuity of the Roots of a Parametric Zero Dimensional Multivariate Polynomial Ideal. 359-365 - Changpeng Shao, Hongbo Li:
Fast Straightening Algorithm for Bracket Polynomials Based on Tableau Manipulations. 367-374 - Adam W. Strzebonski:
Comparison of CAD-based Methods for Computation of Rational Function Limits. 375-382 - Tristan Vaccon, Thibaut Verron, Kazuhiro Yokoyama:
On Affine Tropical F5 Algorithms. 383-390 - Gilles Villard:
On Computing the Resultant of Generic Bivariate Polynomials. 391-398 - Juan Xu, Michael A. Burr, Chee Yap:
An Approach for Certifying Homotopy Continuation Paths: Univariate Case. 399-406
a service of 
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-05-10 18:45 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:
