default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 2017: Kaiserslautern, Germany
- Michael A. Burr, Chee K. Yap, Mohab Safey El Din:
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017. ACM 2017, ISBN 978-1-4503-5064-8
Invited Talks
- Gabriele Nebe:
Computing with Arithmetic Groups. 1-2 - Mark van Hoeij:
Closed Form Solutions for Linear Differential and Difference Equations. 3-4 - James Worrell
:
The Zero Problem for Exponential Polynomials. 5
Tutorials
- Hongbo Li:
Automated Geometric Reasoning with Geometric Algebra: Theory and Practice. 7-8 - Marni Mishna:
Algorithmic Approaches for Lattice Path Combinatorics. 9-10 - Damien Stehlé:
Lattice Reduction Algorithms. 11-12
Contributed Papers
- Parisa Alvandi, Masoud Ataei, Marc Moreno Maza:
On the Extended Hensel Construction and its Application to the Computation of Limit Points. 13-20 - Toru Aoyama:
An Algorithm for Computing Minimal Associated Primes of Binomial Ideals without Producing Redundant Components. 21-27 - Daniel Bahrdt, Martin P. Seybold:
Rational Points on the Unit Sphere: Approximation Complexity and Practical Constructions. 29-36 - Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena:
Irreducibility and Deterministic r-th Root Finding over Finite Fields. 37-44 - Russell J. Bradford, James H. Davenport, Matthew England, Hassan Errami, Vladimir P. Gerdt, Dima Grigoriev, Charles Tapley Hoyt, Marek Kosta, Ovidiu Radulescu, Thomas Sturm, Andreas Weber:
A Case Study on the Parametric Occurrence of Multiple Steady States. 45-52 - Christopher W. Brown:
Projection and Quantifier Elimination Using Non-uniform Cylindrical Algebraic Decomposition. 53-60 - Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas:
The Complexity of an Adaptive Subdivision Method for Approximating Real Curves. 61-68 - Laurent Busé, Ibrahim Nonkané:
Discriminants of Complete Intersection Space Curves. 69-76 - Xavier Caruso, Jérémy Le Borgne:
Fast Multiplication for Skew Polynomials. 77-84 - Liangyu Chen, Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza:
Big Prime Field FFT on the GPU. 85-92 - Yu-Ao Chen, Xiao-Shan Gao:
Criteria for Finite Difference Gröbner Bases of Normal Binomial Difference Ideals. 93-100 - Michael Clausen, Paul Hühne:
Linear Time Fourier Transforms of Sn-k-invariant Functions on the Symmetric Group Sn. 101-108 - Xavier Dahan:
Gcd Modulo a Primary Triangular Set of Dimension Zero. 109-116 - Koen de Boer, Carlo Pagano:
Calculating the Power Residue Symbol and Ibeta: Applications of Computing the Group Structure of the Principal Units of a p-adic Number Field Completion. 117-124 - Jean-Guillaume Dumas, Erich L. Kaltofen, Gilles Villard, Lihong Zhi:
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. 125-132 - Jean-Guillaume Dumas, David Lucas, Clément Pernet:
Certificates for Triangular Equivalence and Rank Profiles. 133-140 - Christian Eder, Gerhard Pfister, Adrian Popescu:
On Signature-Based Gröbner Bases Over Euclidean Rings. 141-148 - Ioannis Z. Emiris, Christos Konaxis, Ilias S. Kotsireas, Clément Laroche:
Matrix Representations by Means of Interpolation. 149-156 - Claus Fieker, William Hart, Tommy Hofmann, Fredrik Johansson:
Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language. 157-164 - Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra:
Parametrizations for Families of ECM-Friendly Curves. 165-171 - Georg Grasegger, Thieu N. Vo:
An Algebraic-Geometric Method for Computing Zolotarev Polynomials. 173-180 - Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing the Nearest Rank-Deficient Matrix Polynomial. 181-188 - Amir Hashemi, Werner M. Seiler:
Dimension-Dependent Upper Bounds for Gröbner Bases. 189-196 - Johannes Hoffmann, Viktor Levandovskyy:
A Constructive Approach to Arithmetics in Ore Localizations. 197-204 - Seung Gyu Hyun, Romain Lebreton, Éric Schost:
Algorithms for Structured Linear Systems Solving and Their Implementation. 205-212 - Hidenao Iwane, Hirokazu Anai:
Formula Simplification for Real Quantifier Elimination Using Geometric Invariance. 213-220 - Andreas Humenberger, Maximilian Jaroschek, Laura Kovács:
Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences. 221-228 - Gorav Jindal, Michael Sagraloff:
Efficiently Computing Real Roots of Sparse Polynomials. 229-236 - Erich L. Kaltofen, Clément Pernet, Arne Storjohann, Cleveland Waddell:
Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction. 237-244 - Manuel Kauers, Gleb Pogudin:
Bounds for Substituting Algebraic Functions into D-finite Functions. 245-252 - Mohamed Khochtali, Johan Rosenkilde, Arne Storjohann:
Popov Form Computation for Matrices of Ore Polynomials. 253-260 - Robin Larrieu:
The Truncated Fourier Transform for Mixed Radices. 261-268 - Hongbo Li, Zhang Li, Yang Li:
Riemann Tensor Polynomial Canonicalization by Graph Algebra Extension. 269-276 - Dong Lu, Xiaodong Ma, Dingkang Wang:
A New Algorithm for General Factorizations of Multivariate Polynomial Matrices. 277-284 - Dmitry A. Lyakhov, Vladimir P. Gerdt, Dominik L. Michels:
Algorithmic Verification of Linearizability for Ordinary Differential Equations. 285-292 - Rusydi H. Makarim, Marc Stevens:
M4GB: An Efficient Gröbner-Basis Algorithm. 293-300 - Angelos Mantzaflaris, Éric Schost, Elias P. Tsigaridas:
Sparse Rational Univariate Representation. 301-308 - Angelos Mantzaflaris, Elias P. Tsigaridas:
Resultants and Discriminants for Bivariate Tensor-Product Polynomials. 309-316 - Ignacio García-Marco, Pascal Koiran, Timothée Pecatte:
Reconstruction Algorithms for Sums of Affine Powers. 317-324 - Johannes Middeke:
Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K. 325-332 - Bernard Mourrain:
Fast Algorithm for Border Bases of Artinian Gorenstein Algebras. 333-340 - Kosaku Nagasaka:
Parametric Greatest Common Divisors using Comprehensive Gröbner Systems. 341-348 - Vincent Neiger, Johan Rosenkilde, Éric Schost:
Fast Computation of the Roots of Polynomials Over the Ring of Power Series. 349-356 - Vincent Neiger, Thi Xuan Vu:
Computing Canonical Bases of Modules of Univariate Relations. 357-364 - John Perry:
Exploring the Dynamic Buchberger Algorithm. 365-372 - Dmitri Piontkovski:
Growth in Varieties of Multioperator Algebras and Groebner Bases in Operads. 373-380 - Swaroop N. Prabhakar, Vikram Sharma:
Improved Bounds on Absolute Positiveness of Multivariate Polynomials. 381-388 - Xavier Caruso, David Roe, Tristan Vaccon:
Characteristic Polynomials of p-adic Matrices. 389-396 - Sidi Mohamed Sedjelmaci:
Two Fast Parallel GCD Algorithms of Many Integers. 397-404 - Carlo Sircana:
Factorization of Polynomials over Z/(pn). 405-412 - Adam W. Strzebonski:
CAD Adjacency Computation Using Validated Numerics. 413-420 - Luiz Emilio Allem, Juliane G. Capaverde, Mark van Hoeij, Jonas Szutkoski:
Functional Decomposition Using Principal Subfields. 421-428 - Tristan Vaccon, Kazuhiro Yokoyama:
A Tropical F5 Algorithm. 429-436 - Joris van der Hoeven, Robin Larrieu:
The Frobenius FFT. 437-444 - Joris van der Hoeven, Grégoire Lecerf:
Composition Modulo Powers of Polynomials. 445-452
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-12-11 20:31 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:
